Disjoint paths, planarizing cycles, and spanning walks

DOI10.1090/S0002-9947-97-01830-8zbMath0945.05038MaRDI QIDQ3127254

Xingxing Yu

Publication date: 8 April 1997

Published in: Transactions of the American Mathematical Society (Search for Journal in Brave)

zbMATH Keywords

embedding; Hamilton cycle; bridge; walk; disjoint paths; representativity; theorem of Thomassen

Mathematics Subject Classification ID

05C38: Paths and cycles

05C10: Planar graphs; geometric and topological aspects of graph theory

57M12: Low-dimensional topology of special (e.g., branched) coverings

Related Items

Unnamed Item, 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, Maximum bipartite subgraphs of cubic triangle-free planar graphs, On certain spanning subgraphs of embeddings with applications to domination, Subgraphs of graphs on surfaces with high representativity, Long cycles in graphs on a fixed surface, A theorem on paths in locally planar triangulations, Extending precolorings of subgraphs of locally planar graphs, On the matching extendability of graphs in 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