Total rainbow connection number and complementary graph

DOI10.1007/S00025-015-0469-8MaRDI QIDQ310863zbMATH OpenOpenAlexFDO

Authors 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)

Recommendations

• Tight Nordhaus-Gaddum-type upper bound for total-rainbow connection number of graphs
• Some upper bounds for the total-rainbow connection number of graphs.
• The total-rainbow \(k\)-connection of 2-connected graphs.
• Upper bounds for the total rainbow connection of graphs
• On total rainbow \(k\)-connected graphs

Cites work

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

Cited in

(16)

• On rainbow total-coloring of a graph
• Rainbow connection number and independence number of a graph
• Some results on the 3-vertex-rainbow index of a graph
• Rainbow vertex connection numbers and total rainbow connection numbers of middle and total graphs.
• Tight Nordhaus-Gaddum-type upper bound for total-rainbow connection number of graphs
• Rainbow connection number and connected dominating sets
• Total rainbow connection numbers of some special graphs
• 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
• Rainbow connection numbers of complementary graphs
• Graphs with small total rainbow connection number
• scientific article; zbMATH DE number 897189 (Why is no real title available?)
• Total-rainbow connection and forbidden subgraphs
• scientific article; zbMATH DE number 6761154 (Why is no real title available?)
• On various (strong) rainbow connection numbers of graphs

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q310863)