2-connected spanning subgraphs with low maximum degree in locally planar graphs
From MaRDI portal
Publication:875943
DOI10.1016/j.jctb.2006.07.002zbMath1119.05028OpenAlexW1966104570MaRDI QIDQ875943
Ken-ichi Kawarabayashi, Mark N. Ellingham
Publication date: 16 April 2007
Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.jctb.2006.07.002
Planar graphs; geometric and topological aspects of graph theory (05C10) Eulerian and Hamiltonian graphs (05C45)
Related Items (4)
Hamiltonicity of graphs on surfaces in terms of toughness and scattering number -- a survey ⋮ What is on his mind? ⋮ On certain spanning subgraphs of embeddings with applications to domination ⋮ On the Hamiltonian property hierarchy of 3-connected planar graphs
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Graph minors. VII: Disjoint paths on a surface
- On 2-connected spanning subgraphs with low maximum degree
- 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
- 2-walks in circuit graphs
- Subgraphs of graphs on surfaces with high representativity
- Long cycles in graphs on a fixed surface
- A theorem on paths in locally planar triangulations
- Nonhamiltonian triangulations with large connectivity and representativity
- Disjoint paths, planarizing cycles, and spanning walks
- A Theorem on Planar Graphs
- 2-connected 7-coverings of 3-connected graphs on surfaces
- 2‐connected coverings of bounded degree in 3‐connected graphs
- Trees in Polyhedral Graphs
- Polytopes, graphs, and complexes
- A theorem on paths in planar graphs
- A theorem on paths in planar graphs
This page was built for publication: 2-connected spanning subgraphs with low maximum degree in locally planar graphs