Full cycle extendability of locally connected K₁,4-restricted graphs

zbMATH Open1459.05139MaRDI QIDQ4691817FDOQ4691817

Authors:

Publication date: 24 October 2018

Full work available at URL: http://mathnet.ru/eng/timb172

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

Mathematics Subject Classification ID

Paths and cycles (05C38) Connectivity (05C40)

Cites Work

• Reducibility among combinatorial problems
• Finding Hamiltonian circuits in proper interval graphs
• A note on locally connected and Hamiltonian-connected graphs
• Complement reducible graphs
• Complexity of the hamiltonian cycle in regular graph problem
• Claw-free graphs---a survey
• Pancyclicity and NP-completeness in planar graphs
• Every connected, locally connected nontrivial graph with no induced claw is hamiltonian
• Title not available (Why is that?)
• Title not available (Why is that?)
• The Planar Hamiltonian Circuit Problem is NP-Complete
• Locally connected graphs
• Hamilton Paths in Grid Graphs
• Title not available (Why is that?)
• Hamiltonian properties of locally connected graphs with bounded vertex degree
• Extending cycles in graphs
• HAMILTONian circuits in chordal bipartite graphs
• The hamiltonian cycle problem is linear-time solvable for 4-connected planar graphs
• Finding Hamiltonian circuits in interval graphs
• Hamiltonian properties of triangular grid graphs
• The edge Hamiltonian path problem is NP-complete
• Title not available (Why is that?)
• Almost claw‐free graphs
• Cycles of given length in some \(K_{1,3}\)-free graphs
• Not being (super)thin or solid is hard: A study of grid Hamiltonicity
• Linear-time algorithms for the Hamiltonian problems on distance-hereditary graphs
• Polynomial Algorithms for Hamiltonian Cycle in Cocomparability Graphs
• Hamiltonian circuits in N₂‐locally connected K_1,3‐free graphs
• Quadrangularly connected claw-free graphs
• Vertex pancyclicity in quasi claw-free graphs
• Linear time algorithms for Hamiltonian problems on (claw, net)-free graphs
• An efficient certifying algorithm for the Hamiltonian cycle problem on circular-arc 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
• Title not available (Why is that?)
• A linear algorithm for constructing a Hamiltonian cycle in a locally connected graph of a triangular lattice

Cited In (8)

• Title not available (Why is that?)
• Title not available (Why is that?)
• 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)