Graphs with rainbow connection number two

DOI10.7151/DMGT.1547MaRDI QIDQ3089355zbMATH OpenOpenAlexFDO

Authors Arnfried Kemnitz, Ingo Schiermeyer

Publication date 24 August 2011

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

Full work available at URL https://semanticscholar.org/paper/c730e20bec1166d94e8085a0a326078404a57bf5

zbMATH Keywords

edge colouringrainbow colouringrainbow connection

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Extremal problems in graph theory (05C35)

Recommendations

• Rainbow connection number two and clique number
• The rainbow connection number of 2-connected graphs
• Sufficient conditions for 2-rainbow connected graphs
• Rainbow connection in sparse graphs
• scientific article; zbMATH DE number 6837036

Cited in

(36)

• Conflict-free connections of graphs
• Rainbow total-coloring of complementary graphs and Erdős-Gallai type problem for the rainbow total-connection number
• Strong rainbow connection in digraphs
• Rainbow connections in digraphs
• Some extremal results on the colorful monochromatic vertex-connectivity of a graph
• The hitting time of rainbow connection number two
• Minimum degree and size conditions for the proper connection number of graphs
• Conflict-free connection number and size of graphs
• Some results on the total proper \(k\)-connection number
• The proper 2-connection number and size of graphs
• Conflict-free vertex connection number at most 3 and size of graphs
• Rainbow connection and forbidden subgraphs
• Note on the hardness of rainbow connections for planar and line graphs
• Proper connection and size of graphs
• Graphs with small total rainbow connection number
• Upper bounds of proper connection number of graphs
• Rainbow connection and minimum degree
• Proper rainbow connection number of graphs
• Rainbow connections for outerplanar graphs with diameter 2 and 3
• Characterize graphs with rainbow connection numbers m-2 and m-3
• Rainbow connection number two and clique number
• Finite families of forbidden subgraphs for rainbow connection in graphs
• Sufficient conditions for 2-rainbow connected graphs
• The rainbow connection number of 2-connected graphs
• Rainbow connection in oriented graphs
• On forbidden subgraphs and rainbow connection in graphs with minimum degree 2
• Rainbow connection number and the number of blocks
• A solution to a conjecture on two rainbow connection numbers of a graph.
• Graphs with vertex rainbow connection number two
• The size of graphs with restricted rainbow 2-connection number
• Rainbow connection in some digraphs
• Erdős-Gallai-type results for colorful monochromatic connectivity of a graph
• Loose edge-connection of graphs
• Cut-through connections of graphs
• On anti-A-connectivity in plane graphs
• Characterizing forbidden pairs for rainbow connection in graphs with minimum degree 2

This page was built for publication: Graphs with rainbow connection number two

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