Hamiltonian path saturated graphs with small size
From MaRDI portal
Publication:2492212
DOI10.1016/J.DAM.2005.05.035zbMath1090.05035OpenAlexW2006892215MaRDI QIDQ2492212
Aneta Dudek, Gyula Y. Katona, Adam Paweł Wojda
Publication date: 9 June 2006
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.dam.2005.05.035
Extremal problems in graph theory (05C35) Paths and cycles (05C38) Eulerian and Hamiltonian graphs (05C45)
Related Items (2)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Large Isaacs' graphs are maximally non-Hamilton-connected
- Smallest claw-free, 2-connected, nontraceable graphs and the construction of maximal nontraceable graphs
- Smallest maximally nonhamiltonian graphs
- Smallest maximally nonhamiltonian graphs. II
- A method in graph theory
- Not every 2-tough graph is Hamiltonian
- Tough graphs and Hamiltonian circuits.
- Saturated graphs with minimal number of edges
- Hamiltonian circuits and path coverings of vertices in graphs
- Infinite Families of Nontrivial Trivalent Graphs Which are Not Tait Colorable
- Hamiltonian shortage, path partitions of vertices, and matchings in a graph
- Graphs maximal with respect to absence of hamiltonian paths
- The $L(2,1)$-Labeling Problem on Graphs
This page was built for publication: Hamiltonian path saturated graphs with small size