Full cycle extendability of locally connected K₁,4-restricted graphs
From MaRDI portal
Publication:4691817
Recommendations
- On Hamilton Cycles in Locally Connected Graphs with Vertex Degree Constraints
- Hamiltonian properties of locally connected graphs with bounded vertex degree
- Fully cycle extendability of \(K_{1,4}\)-restricted graphs
- A strengthening of Kikustapos;s theorem
- Local connectivity, local degree conditions, some forbidden induced subgraphs, and cycle extendability
Cites work
- scientific article; zbMATH DE number 3694608 (Why is no real title available?)
- scientific article; zbMATH DE number 3779369 (Why is no real title available?)
- scientific article; zbMATH DE number 2107092 (Why is no real title available?)
- scientific article; zbMATH DE number 7492076 (Why is no real title available?)
- scientific article; zbMATH DE number 3895002 (Why is no real title available?)
- A linear algorithm for constructing a Hamiltonian cycle in a locally connected graph of a triangular lattice
- A note on locally connected and Hamiltonian-connected graphs
- Almost claw‐free graphs
- An efficient certifying algorithm for the Hamiltonian cycle problem on circular-arc graphs
- Claw-free graphs---a survey
- Complement reducible graphs
- Complexity of the hamiltonian cycle in regular graph problem
- Cycles of given length in some \(K_{1,3}\)-free graphs
- Every connected, locally connected nontrivial graph with no induced claw is hamiltonian
- Extending cycles in graphs
- Finding Hamiltonian circuits in interval graphs
- Finding Hamiltonian circuits in proper interval graphs
- Finding Hamiltonian circuits in quasi-adjoint graphs
- Finding Hamiltonian cycles in \(\{\)quasi-claw, \(K_{1,5},K_{1,5} + e\}\)-free graphs with bounded Dilworth numbers
- Fully cycle extendability of \(K_{1,4}\)-restricted graphs
- HAMILTONian circuits in chordal bipartite graphs
- Hamilton Paths in Grid Graphs
- Hamiltonian circuits in N2‐locally connected K1,3‐free graphs
- Hamiltonian properties of locally connected graphs with bounded vertex degree
- Hamiltonian properties of triangular grid graphs
- Linear time algorithms for Hamiltonian problems on (claw, net)-free graphs
- Linear-time algorithms for the Hamiltonian problems on distance-hereditary graphs
- Locally connected graphs
- Not being (super)thin or solid is hard: A study of grid Hamiltonicity
- Pancyclicity and NP-completeness in planar graphs
- Polynomial Algorithms for Hamiltonian Cycle in Cocomparability Graphs
- Quadrangularly connected claw-free graphs
- Reducibility among combinatorial problems
- The Planar Hamiltonian Circuit Problem is NP-Complete
- The edge Hamiltonian path problem is NP-complete
- The hamiltonian cycle problem is linear-time solvable for 4-connected planar graphs
- Vertex pancyclicity in quasi claw-free graphs
Cited in
(8)- scientific article; zbMATH DE number 1535434 (Why is no real title available?)
- scientific article; zbMATH DE number 2073563 (Why is no real title available?)
- Perfect matchings in graphs with prescribed local restrictions
- Perfect matchings and \(K_{1,p}\)-restricted graphs
- Fully cycle extendability of \(K_{1,4}\)-restricted graphs
- A strengthening of Kikustapos;s theorem
- Local connectivity, local degree conditions, some forbidden induced subgraphs, and cycle extendability
- On Hamilton Cycles in Locally Connected Graphs with Vertex Degree Constraints
This page was built for publication: Full cycle extendability of locally connected \(K_{1,4}\)-restricted graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4691817)
