On rainbow total-coloring of a graph

DOI10.1016/j.dam.2015.05.012zbMath1319.05057OpenAlexW872541285MaRDI QIDQ494442

Yuefang Sun

Publication date: 1 September 2015

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.dam.2015.05.012

zbMATH Keywords

Nordhaus-Gaddum-typerainbow total-coloringrainbow total-connection number

Mathematics Subject Classification ID

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

Related Items (10)

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

Cites Work

• Unnamed Item
• Nordhaus-Gaddum inequalities for domination in graphs
• Rainbow connections of graphs: a survey
• On the strong rainbow connection of a graph
• Nordhaus-Gaddum-type theorem for the rainbow vertex-connection number of a graph
• The rainbow connectivity of a graph
• On the Rainbow Connectivity of Graphs: Complexity and FPT Algorithms
• On Complementary Graphs
• Rainbow connection in graphs
• The Diameter of a Graph and its Complement
• The rainbow connection of a graph is (at most) reciprocal to its minimum degree
• Hardness and Algorithms for Rainbow Connectivity

This page was built for publication: On rainbow total-coloring of a graph