Total rainbow connection number and complementary graph

DOI10.1007/s00025-015-0469-8zbMath1344.05064OpenAlexW1156767371MaRDI QIDQ310863

Yingbin Ma

Publication date: 8 September 2016

Published in: Results in Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00025-015-0469-8

zbMATH Keywords

triangle-freecomplementary graphNordhaus-Gaddum-typerainbow vertex connectedtotal rainbow connectedtotal rainbow pathtotal-coloringvertex rainbow pathvertex-coloring

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Connectivity (05C40)

Related Items (7)

Some results on the total proper \(k\)-connection number ⋮ Some results on the 3-total-rainbow index ⋮ Rainbow total-coloring of complementary graphs and Erdős-Gallai type problem for the rainbow total-connection number ⋮ Tight Nordhaus-Gaddum-type upper bound for total-rainbow connection number of graphs ⋮ Some results on the 3-vertex-rainbow index of a graph ⋮ On various (strong) rainbow connection numbers of graphs ⋮ Total rainbow connection numbers of some special graphs

Cites Work

• Unnamed Item
• Nordhaus-Gaddum-type theorem for rainbow connection number of graphs
• On the rainbow connectivity of graphs: complexity and FPT algorithms
• Total rainbow \(k\)-connection in graphs
• Graphs with vertex rainbow connection number two
• The complexity of determining the rainbow vertex-connection of a graph
• Rainbow connections of graphs: a survey
• A survey of Nordhaus-Gaddum type relations
• On the rainbow vertex-connection
• Rainbow connection numbers of complementary graphs
• Nordhaus-Gaddum-type theorem for the rainbow vertex-connection number of a graph
• On Complementary Graphs
• Rainbow connection in graphs
• The rainbow connection of a graph is (at most) reciprocal to its minimum degree
• The strong rainbow vertex-connection of graphs

This page was built for publication: Total rainbow connection number and complementary graph