scientific article; zbMATH DE number 6963963

zbMath1459.05139MaRDI QIDQ4691817

No author found.

Publication date: 24 October 2018

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

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

Mathematics Subject Classification ID

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

Related Items (2)

Unnamed Item ⋮ Perfect matchings and \(K_{1,p}\)-restricted graphs

Cites Work

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

This page was built for publication: