2-Trees: Structural insights and the study of Hamiltonian paths
From MaRDI portal
Publication:6132868
DOI10.1142/s1793830922501130zbMath1516.05111arXiv1511.02038OpenAlexW2481278500WikidataQ114071633 ScholiaQ114071633MaRDI QIDQ6132868
Publication date: 15 July 2023
Published in: Discrete Mathematics, Algorithms and Applications (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1511.02038
Paths and cycles (05C38) Graph algorithms (graph-theoretic aspects) (05C85) Eulerian and Hamiltonian graphs (05C45)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Linear-time certifying algorithms for the path cover and Hamiltonian cycle problems on interval graphs
- Four sufficient conditions for hamiltonian graphs
- General solutions to the single vehicle routing problem with pickups and deliveries
- A simple algorithm to find Hamiltonian cycles in proper interval graphs
- Hamiltonian properties of triangular grid graphs
- A linear time recognition algorithm for proper interval graphs
- Finding Hamiltonian circuits in interval graphs
- Hamiltonian circuits in interval graph generalizations
- Neighbourhood unions and Hamiltonian properties in graphs
- Forbidden subgraphs and Hamiltonian properties and graphs
- A method in graph theory
- A note on the Hamiltonian circuit problem on directed path graphs
- Forbidden subgraphs, hamiltonicity and closure in claw-free graphs
- Hamiltonian circuits determining the order of chromosomes
- The number of Hamiltonian paths in a rectangular grid
- Characterizing forbidden pairs for hamiltonian properties
- Hypohamiltonian and hypotraceable graphs
- Advances on the Hamiltonian problem -- a survey
- On some intriguing problems in Hamiltonian graph theory---a survey
- HAMILTONian circuits in chordal bipartite graphs
- Sufficient conditions for a graph to be Hamiltonian
- On Hamilton's ideals
- A note on Hamiltonian circuits
- Linear-time algorithms for the Hamiltonian problems on distance-hereditary graphs
- A Problem in Graph Theory
- Note on Hamilton Circuits
- Updating the hamiltonian problem—A survey
- An $O(n^2 \log n)$ Algorithm for the Hamiltonian Cycle Problem on Circular-Arc Graphs
- The Planar Hamiltonian Circuit Problem is NP-Complete
- Onk-ordered Hamiltonian graphs
- Onk-ordered graphs
- Degree conditions for k‐ordered hamiltonian graphs
- Reducibility among Combinatorial Problems
- k-ordered Hamiltonian graphs
- On Hamiltonian Circuits in Finite Graphs
- An Infinite Class of Hypohamiltonian Graphs
- Some Theorems on Abstract Graphs
This page was built for publication: 2-Trees: Structural insights and the study of Hamiltonian paths
