Finite families of forbidden subgraphs for rainbow connection in graphs
From MaRDI portal
(Redirected from Publication:297932)
Recommendations
Cites work
- scientific article; zbMATH DE number 3522018 (Why is no real title available?)
- Graph theory
- Graphs with rainbow connection number two
- Hardness and algorithms for rainbow connection
- On rainbow connection
- On the theory of graphs
- Rainbow connection and forbidden subgraphs
- Rainbow connection in graphs
- Rainbow connection in graphs with minimum degree three
- Rainbow connection number and connected dominating sets
- Rainbow connection number and radius
- Rainbow connection number of dense graphs
- The rainbow connection number of 2-connected graphs
- The rainbow connection of a graph is (at most) reciprocal to its minimum degree
Cited in
(7)- Rainbow vertex-connection and forbidden subgraphs
- Rainbow connection and forbidden subgraphs
- Characterizing forbidden pairs for rainbow connection in graphs with minimum degree 2
- Implications in rainbow forbidden subgraphs
- On forbidden subgraphs and rainbow connection in graphs with minimum degree 2
- Total-rainbow connection and forbidden subgraphs
- 3-rainbow index and forbidden subgraphs
This page was built for publication: Finite families of forbidden subgraphs for rainbow connection in graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q297932)