Total-rainbow connection and forbidden subgraphs
From MaRDI portal
Publication:6633552
Recommendations
Cites work
- 3-rainbow index and forbidden subgraphs
- Characterizing forbidden pairs for rainbow connection in graphs with minimum degree 2
- Complement reducible graphs
- Finite families of forbidden subgraphs for rainbow connection in graphs
- Graph theory
- Hardness result for the total rainbow \(k\)-connection of graphs
- Linear time algorithms for Hamiltonian problems on (claw, net)-free graphs
- On forbidden subgraphs and rainbow connection in graphs with minimum degree 2
- On linear and circular structure of (claw, net)-free graphs
- On rainbow total-coloring of a graph
- On the rainbow connectivity of graphs: complexity and FPT algorithms
- On total rainbow \(k\)-connected graphs
- Rainbow connection and forbidden subgraphs
- Rainbow connection in graphs
- Rainbow connection number and radius
- Rainbow connectivity and rainbow criticality on graph classes
- Rainbow total-coloring of complementary graphs and Erdős-Gallai type problem for the rainbow total-connection number
- Rainbow vertex-connection and forbidden subgraphs
- The rainbow connection of a graph is (at most) reciprocal to its minimum degree
- The strong perfect graph theorem
- Total rainbow \(k\)-connection in graphs
- Total rainbow connection numbers of some special graphs
- Upper bounding rainbow connection number by forest number
This page was built for publication: Total-rainbow connection and forbidden subgraphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6633552)
