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

DOI10.7151/dmgt.2056zbMath1392.05044MaRDI 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 graph; rainbow total-coloring; rainbow total-connection number; Erdős-Gallai-type problem

Mathematics Subject Classification ID

05C35: Extremal problems in graph theory

05C75: Structural characterization of families of graphs

05C15: Coloring of graphs and hypergraphs