A theorem on paths in locally planar triangulations

DOI10.1016/j.ejc.2003.06.004zbMath1050.05074OpenAlexW1970997994MaRDI QIDQ1883289

Ken-ichi Kawarabayashi

Publication date: 4 October 2004

Published in: European Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ejc.2003.06.004

zbMATH Keywords

surfacetriangulationHamiltonian-connectedlarge representativity

Mathematics Subject Classification ID

Paths and cycles (05C38) Planar graphs; geometric and topological aspects of graph theory (05C10) Eulerian and Hamiltonian graphs (05C45)

Related Items (11)

An extension of Sallee's theorem to infinite locally finite VAP-free plane graphs ⋮ Chords of longest circuits in locally planar graphs ⋮ 2-connected spanning subgraphs with low maximum degree in locally planar graphs ⋮ Removal of subgraphs and perfect matchings in graphs on surfaces ⋮ Hamiltonicity of graphs on surfaces in terms of toughness and scattering number -- a survey ⋮ On the matching extendability of graphs in surfaces ⋮ What is on his mind? ⋮ A note on traversing specified vertices in graphs embedded with large representativity ⋮ 2- and 3-factors of graphs on surfaces ⋮ On certain spanning subgraphs of embeddings with applications to domination ⋮ Matching Extension Missing Vertices and Edges in Triangulations of Surfaces

Cites Work

• Unnamed Item
• Unnamed Item
• Graph minors. VII: Disjoint paths on a surface
• Trees in triangulations
• Color-critical graphs on a fixed surface
• Subgraphs of graphs on surfaces with high representativity
• Long cycles in graphs on a fixed surface
• Disjoint paths, planarizing cycles, and spanning walks
• 2-connected 7-coverings of 3-connected graphs on surfaces
• Computing the orientable genus of projective graphs
• A theorem on paths in planar graphs

This page was built for publication: A theorem on paths in locally planar triangulations