Gap strings and spanning forests for bridge graphs of biconnected graphs

DOI10.1016/0166-218X(95)00080-BzbMath0855.68070OpenAlexW2053656903MaRDI QIDQ1923606

Peter W. Stephens

Publication date: 14 January 1997

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

Full work available at URL: https://doi.org/10.1016/0166-218x(95)00080-b

zbMATH Keywords

biconnected graph

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Paths and cycles (05C38) Planar graphs; geometric and topological aspects of graph theory (05C10) Graph labelling (graceful graphs, bandwidth, etc.) (05C78)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Planarity and duality of finite and infinite graphs
• Bridges and Hamiltonian circuits in planar graphs
• Embedding Graphs in the Plane—Algorithmic Aspects
• Efficient Planarity Testing
• An $O(m\log n)$-Time Algorithm for the Maximal Planar Subgraph Problem
• A matrix analysis of carrier posets of biconnected graphs
• Canonical forms for cycles in bridge graphs
• The two basic linear time Planarity algorithms: Are they the same?