Graphs with rainbow connection number two
From MaRDI portal
Publication:3089355
DOI10.7151/DMGT.1547zbMATH Open1234.05092OpenAlexW2005228776MaRDI QIDQ3089355FDOQ3089355
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
Recommendations
Cited In (34)
- Erdős-Gallai-type results for colorful monochromatic connectivity of a graph
- A solution to a conjecture on two rainbow connection numbers of a graph.
- Some extremal results on the colorful monochromatic vertex-connectivity of a graph
- Rainbow connections for outerplanar graphs with diameter 2 and 3
- Rainbow connections in digraphs
- Minimum degree and size conditions for the proper connection number of graphs
- Proper rainbow connection number of graphs
- The size of graphs with restricted rainbow 2-connection number
- The proper 2-connection number and size of graphs
- Upper bounds of proper connection number of graphs
- Finite families of forbidden subgraphs for rainbow connection in graphs
- Sufficient conditions for 2-rainbow connected graphs
- Some results on the total proper \(k\)-connection number
- The rainbow connection number of 2-connected graphs
- Graphs with small total rainbow connection number
- Characterize graphs with rainbow connection numbers \(m-2\) and \(m-3\)
- Rainbow total-coloring of complementary graphs and Erdős-Gallai type problem for the rainbow total-connection number
- Graphs with vertex rainbow connection number two
- Rainbow connection and minimum degree
- Conflict-free connections of graphs
- Note on the hardness of rainbow connections for planar and line graphs
- The hitting time of rainbow connection number two
- Characterizing forbidden pairs for rainbow connection in graphs with minimum degree 2
- Rainbow connection in oriented graphs
- Conflict-free connection number and size of graphs
- On forbidden subgraphs and rainbow connection in graphs with minimum degree 2
- Conflict-free vertex connection number at most 3 and size of graphs
- Proper connection and size of graphs
- Rainbow connection number and the number of blocks
- Rainbow connection number two and clique number
- Rainbow connection and forbidden subgraphs
- Rainbow connection in some digraphs
- Strong rainbow connection in digraphs
- Loose edge-connection of graphs
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)
