Tight Nordhaus-Gaddum-type upper bound for total-rainbow connection number of graphs
From MaRDI portal
Publication:681264
DOI10.1007/s00025-017-0753-xzbMath1378.05065arXiv1703.04065OpenAlexW2606497252MaRDI QIDQ681264
Colton Magnant, Jingshu Zhang, Xue Liang Li, Wen-Jing Li
Publication date: 30 January 2018
Published in: Results in Mathematics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1703.04065
complementary graphNordhaus-Gaddum-type upper boundtotal-rainbow connection numbertotal-rainbow path
Extremal problems in graph theory (05C35) Paths and cycles (05C38) Coloring of graphs and hypergraphs (05C15) Connectivity (05C40)
Related Items (3)
Tight Nordhaus-Gaddum-type upper bound for total-rainbow connection number of graphs ⋮ Nordhaus-gaddum type inequalities for tree covering numbers on unitary cayley graphs of finite rings ⋮ Nordhaus-Gaddum and other bounds for the chromatic edge-stability number
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Total rainbow connection number and complementary graph
- Nordhaus-Gaddum-type theorem for rainbow connection number of graphs
- Total rainbow \(k\)-connection in graphs
- Rainbow connection of graphs with diameter 2
- On rainbow total-coloring of a graph
- Tight Nordhaus-Gaddum-type upper bound for total-rainbow connection number of graphs
- Proper connection numbers of complementary graphs
- Nordhaus-Gaddum inequalities for domination in graphs
- Rainbow connections of graphs: a survey
- A survey of Nordhaus-Gaddum type relations
- Nordhaus-Gaddum-type results for the generalized edge-connectivity of graphs
- On Complementary Graphs
- Rainbow connection in graphs
- The Diameter of a Graph and its Complement
This page was built for publication: Tight Nordhaus-Gaddum-type upper bound for total-rainbow connection number of graphs