Cell rotation graphs of strongly connected orientations of plane graphs with an application

DOI10.1016/S0166-218X(03)00184-7zbMath1020.05055MaRDI QIDQ1408455

Wai Chee Shiu, Heping Zhang, Peter Che Bor Lam

Publication date: 22 September 2003

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

zbMATH Keywords

plane graphperfect matchingear decompositionrotation graphEulerian orientationin-treestrongly connected orientation

Mathematics Subject Classification ID

Trees (05C05) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Structural characterization of families of graphs (05C75) Eulerian and Hamiltonian graphs (05C45)

Related Items (2)

Distance between \(\alpha\)-orientations of plane graphs by facial cycle reversals ⋮ Relations between Clar structures, Clar covers, and the sextet-rotation tree of a hexagonal system

Cites Work

• The rotation graphs of perfect matchings of plane bipartite graphs
• A note on the number of perfect matchings of bipartite graphs
• Hamilton cycles in Euler tour graphs
• Handle bases and bounds on the number of subgraphs
• Matching theory
• On some counting polynomials in chemistry
• Directed tree structure of the set of Kekulé patterns of generalized polyhex graphs
• Eulerian graphs and related topics. Part 1, Volume 1
• On minimal elementary bipartite graphs
• Plane elementary bipartite graphs
• Transformations of Euler Tours
• A Theorem on Graphs, with an Application to a Problem of Traffic Control
• Unnamed Item
• Unnamed Item

This page was built for publication: Cell rotation graphs of strongly connected orientations of plane graphs with an application