Canonical forms for cycles in bridge graphs

DOI10.1080/03081089308818229zbMath0822.05042OpenAlexW1981297839MaRDI QIDQ4322544

S. Gill Williamson

Publication date: 5 October 1995

Published in: Linear and Multilinear Algebra (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/03081089308818229

zbMATH Keywords

algorithmcyclecharacterizationposetsbridgesoverlap graphbridge graphbiconnected graphKuratowski theoremcanonical forms for cyclesthree-cycle

Mathematics Subject Classification ID

Combinatorics of partially ordered sets (06A07) Paths and cycles (05C38) Planar graphs; geometric and topological aspects of graph theory (05C10) Graph algorithms (graph-theoretic aspects) (05C85)

Related Items (2)

Gap strings and spanning forests for bridge graphs of biconnected graphs ⋮ A matrix analysis of carrier posets of biconnected graphs

Cites Work

• Unnamed Item
• Planarity and duality of finite and infinite graphs
• Bridges and Hamiltonian circuits in planar graphs
• Ranking and unranking planar embeddings
• Depth-First Search and Kuratowski Subgraphs
• Efficient Planarity Testing
• The two basic linear time Planarity algorithms: Are they the same?

This page was built for publication: Canonical forms for cycles in bridge graphs