Disjoint paths, planarizing cycles, and spanning walks
From MaRDI portal
Publication:3127254
DOI10.1090/S0002-9947-97-01830-8zbMath0945.05038MaRDI QIDQ3127254
Publication date: 8 April 1997
Published in: Transactions of the American Mathematical Society (Search for Journal in Brave)
Paths and cycles (05C38) Planar graphs; geometric and topological aspects of graph theory (05C10) Low-dimensional topology of special (e.g., branched) coverings (57M12)
Related Items (35)
On 2-factors splitting an embedded graph into two plane graphs ⋮ A theorem on paths in locally planar triangulations ⋮ Extending precolorings of subgraphs of locally planar graphs ⋮ A cycle cover of a 2-edge-connected graph embedded with large face-width on an orientable surface ⋮ The number of defective colorings of graphs on surfaces ⋮ Every 5-connected planar triangulation is 4-ordered Hamiltonian ⋮ Chords of longest circuits in locally 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 ⋮ Computing Tutte Paths ⋮ The circumference of a graph with no \(K_{3,t}\)-minor. II ⋮ Removal of subgraphs and perfect matchings in graphs on surfaces ⋮ Algorithms for the edge-width of an embedded graph ⋮ Hamiltonicity of graphs on surfaces in terms of toughness and scattering number -- a survey ⋮ Subgraphs of graphs on surfaces with high representativity ⋮ Recent advances on the Hamiltonian problem: survey III ⋮ Spanning trees: A survey ⋮ On the matching extendability of graphs in surfaces ⋮ Light paths in 4-connected graphs in the plane and other surfaces ⋮ Box representations of embedded graphs ⋮ Unnamed Item ⋮ What is on his mind? ⋮ A note on traversing specified vertices in graphs embedded with large representativity ⋮ Spanning trees in 3-connected \(K_{3,t}\)-minor-free graphs ⋮ 2- and 3-factors of graphs on surfaces ⋮ 2-edge-Hamiltonian-connectedness of 4-connected plane graphs ⋮ Toroidal grid minors and stretch in embedded graphs ⋮ Maximum bipartite subgraphs of cubic triangle-free planar graphs ⋮ Hamiltonian cycles in bipartite quadrangulations on the torus ⋮ On certain spanning subgraphs of embeddings with applications to domination ⋮ Facial Nonrepetitive Vertex Coloring of Plane Graphs ⋮ Long cycles in graphs on a fixed surface ⋮ Tutte paths and long cycles in circuit graphs ⋮ Equivalence of Jackson's and Thomassen's conjectures ⋮ Matching Extension Missing Vertices and Edges in Triangulations of Surfaces
Cites Work
- Unnamed Item
- Unnamed Item
- Embeddings of graphs with no short noncontractible cycles
- Five-coloring maps on surfaces
- Trees in triangulations
- 4-connected projective planar graphs are Hamiltonian
- Spanning trees in locally planar triangulations
- 2-walks in circuit graphs
- Five-connected toroidal graphs are Hamiltonian
- A theorem on graphs
- Spanning planar subgraphs of graphs in the torus and Klein bottle
- The uniqueness of a certain graph
- On the genus and connectivity of Hamiltonian graphs
- A Theorem on Planar Graphs
- Polytopes, graphs, and complexes
- A theorem on paths in planar graphs
This page was built for publication: Disjoint paths, planarizing cycles, and spanning walks
