Erdős-Gallai-type results for total monochromatic connection of graphs

DOI10.7151/dmgt.2095zbMath1415.05053arXiv1612.05381OpenAlexW2962969405MaRDI QIDQ2312052

Yingying Zhang, Hui Jiang, Xue Liang Li

Publication date: 4 July 2019

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

Full work available at URL: https://arxiv.org/abs/1612.05381

zbMATH Keywords

Erdős-Gallai-type problemtotal colored graphtotal monochromatic connection

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Paths and cycles (05C38) Coloring of graphs and hypergraphs (05C15) Connectivity (05C40)

Related Items (6)

Monochromatic disconnection: Erdős-Gallai-type problems and product graphs ⋮ Erdös-Gallai-type problems for distance-edge-monitoring numbers ⋮ The \(g\)-component connectivity of graphs ⋮ Monochromatic \(k\)-edge-connection colorings of graphs ⋮ On the \(g\)-good-neighbor connectivity of graphs ⋮ Fractional matching preclusion number of graphs

Cites Work

• Unnamed Item
• Upper bounds for the total rainbow connection of graphs
• Total rainbow \(k\)-connection in graphs
• On rainbow total-coloring of a graph
• Monochromatic connecting colorings in strongly connected oriented graphs
• Erdős-Gallai-type results for colorful monochromatic connectivity of a graph
• More on the colorful monochromatic connectivity
• Some extremal results on the colorful monochromatic vertex-connectivity of a graph
• Colorful monochromatic connectivity
• Total monochromatic connection of graphs
• More on total monochromatic connection of graphs
• Spanning trees with many leaves

This page was built for publication: Erdős-Gallai-type results for total monochromatic connection of graphs