A matrix analysis of carrier posets of biconnected graphs

DOI10.1080/03081089508818339zbMath0817.05046OpenAlexW2061691540MaRDI QIDQ4322525

Peter W. Stephens

Publication date: 9 February 1995

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

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

zbMATH Keywords

posetmatricesbiconnected simple graphsbroken cycle content functionsbroken cycle content matrixfull span chainoptimal graph algorithms

Mathematics Subject Classification ID

Trees (05C05) Combinatorics of partially ordered sets (06A07) Paths and cycles (05C38) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Graph algorithms (graph-theoretic aspects) (05C85)

Related Items (1)

Gap strings and spanning forests for bridge graphs of biconnected graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Planarity and duality of finite and infinite graphs
• Bridges and Hamiltonian circuits in planar graphs
• Determining outerplanarity using segment graphs
• Finding triconnected components of graphs
• Embedding Graphs in the Plane—Algorithmic Aspects
• Efficient Planarity Testing
• Canonical forms for cycles in bridge graphs
• The two basic linear time Planarity algorithms: Are they the same?

This page was built for publication: A matrix analysis of carrier posets of biconnected graphs