On 2-connected spanning subgraphs with low maximum degree
From MaRDI portal
Publication:1127880
DOI10.1006/jctb.1998.1836zbMath0904.05027OpenAlexW2015334554MaRDI QIDQ1127880
Publication date: 10 August 1998
Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)
Full work available at URL: https://semanticscholar.org/paper/d3a0b1ba7f812b24f4070311e8e15f68ca1bda91
Extremal problems in graph theory (05C35) Planar graphs; geometric and topological aspects of graph theory (05C10) Eulerian and Hamiltonian graphs (05C45)
Related Items
Unnamed Item ⋮ 2-connected spanning subgraphs with low maximum degree in locally planar graphs ⋮ A Dirac theorem for trestles ⋮ Hamiltonicity of graphs on surfaces in terms of toughness and scattering number -- a survey ⋮ Subgraphs of graphs on surfaces with high representativity ⋮ Finding large cycles in Hamiltonian graphs ⋮ Two local and one global properties of 3-connected graphs on compact 2-dimensional manifolds ⋮ Surfaces, tree-width, clique-minors, and partitions ⋮ Long cycles in graphs on a fixed surface
Cites Work
- Trees in triangulations
- Contractible triples in 3-connected graphs
- 4-connected projective planar graphs are Hamiltonian
- 2-connected spanning subgraphs of planar 3-connected graphs
- Spanning planar subgraphs of graphs in the torus and Klein bottle
- Das Geschlecht des vollständigen paaren Graphen
- On the genus and connectivity of Hamiltonian graphs
- A Theorem on Planar Graphs
- 2‐connected coverings of bounded degree in 3‐connected graphs
- On Hamilton cycles in certain planar graphs
- Der vollständige paare Graph auf nichtorientierbaren Flächen.
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item