Tight Nordhaus–Gaddum-Type Upper Bound for Total-Rainbow Connection Number of Graphs
Crossref DOI link: https://doi.org/10.1007/s00025-017-0753-x
Published Online: 2017-09-19
Published Print: 2017-12
Update policy: https://doi.org/10.1007/springer_crossmark_policy
Li, Wenjing
Li, Xueliang
Magnant, Colton
Zhang, Jingshu
Funding for this research was provided by:
NSFC (11371205, 11531011)
License valid from 2017-09-19