Cycles of given length in some K₁,3-free graphs
A graph G is \(K_{1,3}\)-free if no induced subgraph of G is isomorphic to \(K_{1,3}\). A graph G is pancyclic if it contains cycles of all possible lengths. The author proves that if any vertex cut of G contains a vertex v such that G(N(v)) is connected, then G is pancyclic. Further, if G(N(v)) is connected for any vertex v of G then the author proves that G is vertex pancyclic (i.e. each vertex of G is contained in cycles of all possible lengths). A polynomial time algorithm for constructing cycles of given length passing through a given vertex of G is given.
- Vertex pancyclicity in quasi-claw-free graphs
- Panconnectivity of locally connected claw-free graphs
- Claw-free graphs---a survey
- Long cycles and 3-connected spanning subgraphs of bounded degree in 3- connected \(K_{1,d}\)-free graphs
- Modification of CZ₃-free condition to have a cycle containing specified vertices
- Pancyclicity modulo 5 of \(K_{1,4}\)-free graphs
- scientific article; zbMATH DE number 4108813 (Why is no real title available?)
- Full cycle extendability of locally connected \(K_{1,4}\)-restricted graphs
- Local connectivity, local degree conditions, some forbidden induced subgraphs, and cycle extendability
- Hamiltonian connectedness in claw-free graphs
- Hamiltonian properties of locally connected graphs with bounded vertex degree
- Vertex pancyclicity in quasi claw-free graphs
- Vertex pancyclicity of quadrangularly connected claw-free graphs
This page was built for publication: Cycles of given length in some \(K_{1,3}\)-free graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q749554)
