Rainbow total-coloring of complementary graphs and Erdős-Gallai type problem for the rainbow total-connection number

DOI10.7151/DMGT.2056zbMath1392.05044OpenAlexW2794036137WikidataQ130086516 ScholiaQ130086516MaRDI QIDQ1656916

Y. Aharonov

Publication date: 10 August 2018

Published in: Discussiones Mathematicae. Graph Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.7151/dmgt.2056

zbMATH Keywords

complementary graphrainbow total-coloringrainbow total-connection numberErdős-Gallai-type problem

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Structural characterization of families of graphs (05C75) Coloring of graphs and hypergraphs (05C15)

Related Items (2)

On total rainbow \(k\)-connected graphs ⋮ Facial rainbow coloring of plane graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Hardness results for total rainbow connection of graphs
• Rainbow connections for outerplanar graphs with diameter 2 and 3
• Total rainbow connection number and complementary graph
• On the rainbow connectivity of graphs: complexity and FPT algorithms
• Total rainbow \(k\)-connection in graphs
• Hardness and algorithms for rainbow connection
• On rainbow total-coloring of a graph
• The complexity of determining the rainbow vertex-connection of a graph
• Note on minimally \(d\)-rainbow connected graphs
• On total rainbow \(k\)-connected graphs
• Upper bounds for the rainbow connection numbers of line graphs
• Rainbow connections of graphs: a survey
• On the strong rainbow connection of a graph
• Rainbow connection numbers of complementary graphs
• The rainbow connectivity of a graph
• Graphs with rainbow connection number two
• Rainbow connection in graphs
• Oriented diameter and rainbow connection number of a graph
• The rainbow connection of a graph is (at most) reciprocal to its minimum degree

This page was built for publication: Rainbow total-coloring of complementary graphs and Erdős-Gallai type problem for the rainbow total-connection number