Rainbow Connection in Graphs with Minimum Degree Three
From MaRDI portal
Publication:3651569
DOI10.1007/978-3-642-10217-2_42zbMath1267.05125OpenAlexW2099126571MaRDI QIDQ3651569
Publication date: 11 December 2009
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-10217-2_42
Related Items (32)
Hardness results for total rainbow connection of graphs ⋮ Rainbow connections for outerplanar graphs with diameter 2 and 3 ⋮ Finite families of forbidden subgraphs for rainbow connection in graphs ⋮ Sufficient conditions for 2-rainbow connected graphs ⋮ Rainbow connection number, bridges and radius ⋮ Rainbow connection number and independence number of a graph ⋮ Rainbow colouring of split graphs ⋮ Conflict-free connections of graphs ⋮ Proper rainbow connection number of graphs ⋮ Proper connection and size of graphs ⋮ Rainbow connection in 3-connected graphs ⋮ Rainbow connection numbers of Cayley graphs ⋮ The rainbow connection number of 2-connected graphs ⋮ Upper bounds for the rainbow connection numbers of line graphs ⋮ Tight upper bound of the rainbow vertex-connection number for 2-connected graphs ⋮ Rainbow connection of graphs with diameter 2 ⋮ Rainbow connections of graphs: a survey ⋮ Characterizing forbidden pairs for rainbow connection in graphs with minimum degree 2 ⋮ Polynomial algorithm for sharp upper bound of rainbow connection number of maximal outerplanar graphs ⋮ Strong rainbow connection in digraphs ⋮ The complexity of determining the rainbow vertex-connection of a graph ⋮ Rainbow connection and minimum degree ⋮ Rainbow connection in oriented graphs ⋮ On forbidden subgraphs and rainbow connection in graphs with minimum degree 2 ⋮ Rainbow connections in digraphs ⋮ Rainbow vertex-connection and graph products ⋮ Minimum degree and size conditions for the proper connection number of graphs ⋮ Rainbow connection and graph products ⋮ Conflict-free connection number and size of graphs ⋮ Rainbow connectivity and rainbow criticality on graph classes ⋮ Rainbow connection and forbidden subgraphs ⋮ Note on the hardness of rainbow connections for planar and line graphs
This page was built for publication: Rainbow Connection in Graphs with Minimum Degree Three
