On essential and inessential polygons in embedded graphs

DOI10.1006/jctb.2001.2065zbMath1025.05016OpenAlexW1995705554MaRDI QIDQ1850578

R. Bruce Richter, Richard P. Vitray

Publication date: 10 December 2002

Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1006/jctb.2001.2065

zbMATH Keywords

discface chainorientable imbedding

Mathematics Subject Classification ID

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

Related Items (3)

Unnamed Item ⋮ Non-revisiting paths on surfaces with low genus ⋮ Connectivity and \(W_v\)-paths in polyhedral maps on surfaces

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Disjoint circuits of prescribed homotopies in a graph on a compact surface
• W\({}_ V\) paths on the torus
• \(W_ v\) paths in the projective plane
• Graph minors. VII: Disjoint paths on a surface
• Non-revisiting paths on surfaces with low genus
• Nonrevisiting paths on surfaces
• Separating and nonseparating disjoint homotopic cycles in graph embeddings
• Curves von 2-manifolds and isotopies
• Combinatorial Local Planarity and the Width of Graph Embeddings
• Computing the orientable genus of projective graphs

This page was built for publication: On essential and inessential polygons in embedded graphs