Combinatorics of orientation reversing polygons

DOI10.1007/BF02189819MaRDI QIDQ1075334zbMATH OpenOpenAlexFDO

Authors Sóstenes Lins

Publication date 1985

Published in Aequationes Mathematicae (Search for Journal in Brave)

Full work available at URL https://eudml.org/doc/137085

zbMATH Keywords

Eulerian graphgemgraph encoded mapimbalanceMöbius striporientable surfaceparity embeddingr-polygonreversing polygonskew embedding

Mathematics Subject Classification ID

Planar graphs; geometric and topological aspects of graph theory (05C10) Relations of low-dimensional topology with graph theory (57M15)

Review text

Let G be a connected finite graph. An embedding of G in a surface S is a parity embedding iff each of its polygons is a reversing polygon (r- polygon), i.e. the polygon whose regular neighborhood is a Möbius strip. Some other concepts used in the paper are e.g. a skew embedding, a graph encoded map (gem) and an imbalance in a gem. We state the next three theorems: Theorem 2. A polygon P is an r-polygon iff P is a homomorphic image of an odd circuit from a corresponding gem. Theorem 4. An embedding of G is a parity embedding iff there exists a skew embedding of G on an orientable surface. Theorem 5. Let G be an Eulerian graph for which there exists either an embedding in the real projective plane or skew embedding in the sphere. Then the minimum cardinality of an imbalance equals the maximum of an edge disjoint set of r-circuits.

Recommendations

• The order upper bound on parity embedding of a graph
• Even embeddings of the complete graphs and their cycle parities
• On essential and inessential polygons in embedded graphs
• The largest parity demigenus of a simple graph
• Publication:4722086

Cites work

• 2-Matchings and 2-covers of hypergraphs
• A minimax theorem on circuits in projective graphs
• A sequence representation for maps
• Combinatorial maps
• Generalized Embedding Schemes
• Graph-encoded maps
• scientific article; zbMATH DE number 3643026 (Why is no real title available?)
• scientific article; zbMATH DE number 3912413 (Why is no real title available?)
• scientific article; zbMATH DE number 3544865 (Why is no real title available?)
• scientific article; zbMATH DE number 3579615 (Why is no real title available?)
• scientific article; zbMATH DE number 3450230 (Why is no real title available?)

Cited in

(7)

• Generalized thrackle drawings of non-bipartite graphs
• Generalized handles in graphs and connected sums of manifolds
• The largest parity demigenus of a simple graph
• Signed analogs of bipartite graphs
• Cycle reversals in oriented plane quadrangulations and orthogonal plane partitions
• The order upper bound on parity embedding of a graph
• Pre-signed graphs: a reformulation of signed graphs and their embeddings

This page was built for publication: Combinatorics of orientation reversing polygons

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1075334)