Computing the orientable genus of projective graphs

DOI10.1002/jgt.3190200305zbMath0837.05051OpenAlexW2081589084MaRDI QIDQ4857427

John Philip Huneke, J. R. Fiedler, Neil Robertson, R. Bruce Richter

Publication date: 13 May 1996

Published in: Journal of Graph Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/jgt.3190200305

zbMATH Keywords

surfaceembeddingwidthprojective planeorientable genusrepresentativityprojective graphspolynomial time testing

Mathematics Subject Classification ID

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

Related Items (32)

Classes of graphs embeddable in order-dependent surfaces ⋮ Spanning Eulerian subgraphs of bounded degree in triangulations ⋮ A theorem on paths in locally planar triangulations ⋮ Unnamed Item ⋮ Trading crossings for handles and crosscaps ⋮ On the orientable genus of graphs embedded in the klein bottle ⋮ Unnamed Item ⋮ The \(\mathbb{Z}_2\)-genus of Kuratowski minors ⋮ Obstructions for embedding cubic graphs on the spindle surface ⋮ Apex graphs with embeddings of face-width three ⋮ On the orientable genus of graphs with bounded nonorientable genus ⋮ Four-terminal reducibility and projective-planar wye-delta-wye-reducible graphs ⋮ Approximation Algorithms for Euler Genus and Related Problems ⋮ The crossing number of a projective graph is quadratic in the face–width ⋮ Decomposing plane cubic graphs ⋮ Blocking nonorientability of a surface ⋮ Algorithms for the edge-width of an embedded graph ⋮ Orientable embeddings and orientable cycle double covers of projective-planar graphs ⋮ Strongly even cycle decomposable non-planar line graphs ⋮ Densely embedded graphs ⋮ Subgraphs of graphs on surfaces with high representativity ⋮ Dominating sets in triangulations on surfaces ⋮ Minimum cycle bases of graphs on surfaces ⋮ On the uniqueness of kernels ⋮ The $\mathbb{Z}_2$-genus of Kuratowski minors ⋮ Toroidal grid minors and stretch in embedded graphs ⋮ Covering projective planar graphs with three forests ⋮ On certain spanning subgraphs of embeddings with applications to domination ⋮ Surfaces, tree-width, clique-minors, and partitions ⋮ On essential and inessential polygons in embedded graphs ⋮ Long cycles in 3-connected graphs ⋮ Embeddings of graphs

This page was built for publication: Computing the orientable genus of projective graphs