Hamiltonicity of graphs on surfaces in terms of toughness and scattering number -- a survey
From MaRDI portal
Publication:2695475
DOI10.1007/978-3-030-90048-9_7OpenAlexW3208233793MaRDI QIDQ2695475
Publication date: 31 March 2023
Full work available at URL: https://doi.org/10.1007/978-3-030-90048-9_7
Trees (05C05) Applications of game theory (91A80) Graph theory (including graph drawing) in computer science (68R10) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Paths and cycles (05C38) Planar graphs; geometric and topological aspects of graph theory (05C10) Eulerian and Hamiltonian graphs (05C45)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Spanning closed walks and TSP in 3-connected planar graphs
- Toughness of \(K_{a,t}\)-minor-free graphs
- The edge-density for \(K_{2,t}\) minors
- Spanning trees: A survey
- Spanning trees in 3-connected \(K_{3,t}\)-minor-free graphs
- Hamiltonian properties of polyhedra with few 3-cuts. A survey
- A new proof that 4-connected planar graphs are Hamiltonian-connected
- A linear algorithm for finding Hamiltonian cycles in 4-connected maximal planar graphs
- The circumference of a graph with no \(K_{3,t}\)-minor
- 2-connected spanning subgraphs with low maximum degree in locally planar graphs
- 3-trees with few vertices of degree 3 in circuit graphs
- Decomposition theorems for the torus, projective plane and Klein bottle
- On a connection between the existence of k-trees and the toughness of a graph
- Connected spanning subgraphs of 3-connected planar graphs
- On 2-connected spanning subgraphs with low maximum degree
- A 1-tough nonhamiltonian maximal planar graph
- Planar graphs: Theory and algorithms
- Connectivity, genus, and the number of components in vertex-deleted subgraphs
- Bridges and Hamiltonian circuits in planar graphs
- Hamiltonian circuits in prisms over certain simple 3-polytopes
- On a class of posets and the corresponding comparability graphs
- On spanning subgraphs of 4-connected planar graphs
- Trees in triangulations
- 4-connected projective planar graphs are Hamiltonian
- Spanning trees in locally planar triangulations
- 2-connected spanning subgraphs of planar 3-connected graphs
- Spanning Eulerian subgraphs of bounded degree in triangulations
- 2-walks in circuit graphs
- Five-connected toroidal graphs are Hamiltonian
- Maximum and minimum toughness of graphs of small genus
- Any maximal planar graph with only one separating triangle is Hamiltonian
- Subgraphs of graphs on surfaces with high representativity
- On some intriguing problems in Hamiltonian graph theory---a survey
- Polyhedra with few 3-cuts are Hamiltonian
- 3-trees in polyhedral maps
- Long cycles in graphs on a fixed surface
- \(K_{a,k}\) minors in graphs of bounded tree-width
- Cycles in 4-connected planar graphs
- A theorem on paths in locally planar triangulations
- Spanning planar subgraphs of graphs in the torus and Klein bottle
- Nonhamiltonian triangulations with large connectivity and representativity
- Hamiltonian cycles in bipartite toroidal graphs with a partite set of degree four vertices
- Not every 2-tough graph is Hamiltonian
- A counterexample to prism-Hamiltonicity of 3-connected planar graphs
- 4-connected projective-planar graphs are Hamiltonian-connected
- Toughness and nonhamiltonicity of polyhedral graphs
- A note on circuit graphs
- Each maximal planar graph with exactly two separating triangles is Hamiltonian
- Das Geschlecht des vollständigen paaren Graphen
- Hamilton paths in toroidal graphs
- Toughness in graphs -- a survey
- Tough graphs and Hamiltonian circuits. (Reprint)
- 2-edge-Hamiltonian-connectedness of 4-connected plane graphs
- Tough graphs and Hamiltonian circuits.
- Hamiltonian circuits in certain prisms
- A Characterization of $K_{2,4}$-Minor-Free Graphs
- On the Strongest Form of a Theorem of Whitney for Hamiltonian Cycles in Plane Triangulations
- The hamiltonian cycle problem is linear-time solvable for 4-connected planar graphs
- Hamiltonian cycles in bipartite quadrangulations on the torus
- Disjoint paths, planarizing cycles, and spanning walks
- A Theorem on Planar Graphs
- 5-Connected Toroidal Graphs are Hamiltonian-Connected
- Toughness and the existence ofk-factors
- The Hamiltonian Circuit Problem is Polynomial for 4-Connected Planar Graphs
- Hamiltonian cycles in planar triangulations with no separating triangles
- Computing 2-Walks in Polynomial Time
- Every 4-Connected Graph with Crossing Number 2 is Hamiltonian
- Hamiltonicity of planar graphs with a forbidden minor
- A characterization of Hamiltonian prisms
- Hamilton cycles in plane triangulations
- 2-connected 7-coverings of 3-connected graphs on surfaces
- Hamiltonicity of 5‐Connected Toroidal Triangulations
- 2‐connected coverings of bounded degree in 3‐connected graphs
- On Hamilton cycles in certain planar graphs
- Toughness, trees, and walks
- Spanning Trees with Bounded Maximum Degrees of Graphs on Surfaces
- Der vollständige paare Graph auf nichtorientierbaren Flächen.
- Hamilton cycles in prisms
- Prism‐hamiltonicity of triangulations
- Trees in Polyhedral Graphs
- Polytopes, graphs, and complexes
- On Hamiltonian Circuits
- A theorem on paths in planar graphs
- A theorem on paths in planar graphs
- On 3‐polytopes with non‐Hamiltonian prisms
