Deficiency and forbidden subgraphs of connected, locally-connected graphs
From MaRDI portal
Publication:2282473
Recommendations
Cites work
- 1-Factors and Antifactor Sets
- Claw-free graphs---a survey
- Every connected, locally connected nontrivial graph with no induced claw is hamiltonian
- Forbidden subgraphs and bounds on the size of a maximum matching
- Graph theory with applications
- Hamiltonian properties of almost locally connected claw-free graphs.
- scientific article; zbMATH DE number 3492724 (Why is no real title available?)
- Local connectivity, local degree conditions, some forbidden induced subgraphs, and cycle extendability
- Locally connected graphs
- Lower bounds for locally highly connected graphs
- On partitioning the edges of graphs into connected subgraphs
- Quasilocally Connected, Almost Locally Connected Or Triangularly Connected Claw-Free Graphs
- The Ryjáček closure and a forbidden subgraph
Cited in
(2)
This page was built for publication: Deficiency and forbidden subgraphs of connected, locally-connected graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2282473)