ALGEBRAIC CHARACTERIZATIONS OF GRAPH IMBEDDABILITY IN SURFACES AND PSEUDOSURFACES
From MaRDI portal
Publication:5493884
DOI10.1142/S0218216506004683zbMath1100.05025MaRDI QIDQ5493884
Lowell Abrams, Daniel C. Slilaty
Publication date: 16 October 2006
Published in: Journal of Knot Theory and Its Ramifications (Search for Journal in Brave)
Planar graphs; geometric and topological aspects of graph theory (05C10) Relations of low-dimensional topology with graph theory (57M15)
Related Items (4)
Deletion-contraction and the surface Tutte polynomial ⋮ Antiparallel \(d\)-stable traces and a stronger version of ore problem ⋮ The smallest self-dual embeddable graphs in a pseudosurface ⋮ Self-dual embeddings of K_{4m,4n} in different orientable and nonorientable pseudosurfaces with the same Euler characteristic
Cites Work
- Unnamed Item
- Unnamed Item
- A structural characterization of planar combinatorial graphs
- Walks through every edge exactly twice
- An algebraic characterization of planar graphs
- An algebraic characterization of projective‐planar graphs
- Walks through every edge exactly twice II
- On the surface duality of linear graphs
- PLANAR GRAPHS AND RELATED TOPICS
This page was built for publication: ALGEBRAIC CHARACTERIZATIONS OF GRAPH IMBEDDABILITY IN SURFACES AND PSEUDOSURFACES