On forbidden subgraphs and rainbow connection in graphs with minimum degree 2
DOI10.1016/J.DISC.2014.10.006zbMATH Open1305.05150OpenAlexW2056262419MaRDI QIDQ482191FDOQ482191
Zdeněk Ryjáček, Přemysl Holub, Ingo Schiermeyer
Publication date: 19 December 2014
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.disc.2014.10.006
Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60) Extremal problems in graph theory (05C35) Vertex degrees (05C07) Coloring of graphs and hypergraphs (05C15) Connectivity (05C40)
Cites Work
- Title not available (Why is that?)
- On rainbow connection
- Rainbow connections of graphs: a survey
- Rainbow connection number and connected dominating sets
- Rainbow connection in graphs
- Hardness and algorithms for rainbow connection
- The rainbow connection of a graph is (at most) reciprocal to its minimum degree
- Rainbow Connection in Graphs with Minimum Degree Three
- Dominating cliques in \(P_ 5\)-free graphs
- Graphs with rainbow connection number two
- Rainbow connection number of dense graphs
- The rainbow connection number of 2-connected graphs
- Rainbow connection number and radius
Cited In (6)
- Characterizing forbidden pairs for rainbow connection in graphs with minimum degree 2
- Total-rainbow connection and forbidden subgraphs
- Odd connection and odd vertex-connection of graphs
- On total rainbow \(k\)-connected graphs
- From colourful to rainbow paths in graphs: colouring the vertices
- Loose edge-connection of graphs
Recommendations
This page was built for publication: On forbidden subgraphs and rainbow connection in graphs with minimum degree 2
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q482191)
