Graphs with rainbow connection number two
From MaRDI portal
Publication:3089355
DOI10.7151/dmgt.1547zbMath1234.05092OpenAlexW2005228776MaRDI QIDQ3089355
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
Related Items (28)
Rainbow connections for outerplanar graphs with diameter 2 and 3 ⋮ Some results on the total proper \(k\)-connection number ⋮ Finite families of forbidden subgraphs for rainbow connection in graphs ⋮ Sufficient conditions for 2-rainbow connected graphs ⋮ Conflict-free connections of graphs ⋮ Rainbow total-coloring of complementary graphs and Erdős-Gallai type problem for the rainbow total-connection number ⋮ The proper 2-connection number and size of graphs ⋮ Proper rainbow connection number of graphs ⋮ Proper connection and size of graphs ⋮ Graphs with small total rainbow connection number ⋮ Upper bounds of proper connection number of graphs ⋮ Rainbow connections of graphs: a survey ⋮ Characterizing forbidden pairs for rainbow connection in graphs with minimum degree 2 ⋮ Loose edge-connection of graphs ⋮ Strong rainbow connection in digraphs ⋮ Rainbow connection and minimum degree ⋮ Rainbow connection in oriented graphs ⋮ Conflict-free vertex connection number at most 3 and size of graphs ⋮ On forbidden subgraphs and rainbow connection in graphs with minimum degree 2 ⋮ Graphs with vertex rainbow connection number two ⋮ Rainbow connection in some digraphs ⋮ Erdős-Gallai-type results for colorful monochromatic connectivity of a graph ⋮ Rainbow connections in digraphs ⋮ Some extremal results on the colorful monochromatic vertex-connectivity of a graph ⋮ Minimum degree and size conditions for the proper connection number of graphs ⋮ Conflict-free connection number and size of graphs ⋮ Rainbow connection and forbidden subgraphs ⋮ Note on the hardness of rainbow connections for planar and line graphs
This page was built for publication: Graphs with rainbow connection number two
