Finding triconnected components of graphs

DOI10.1080/03081088308817513MaRDI QIDQ3659812zbMATH OpenOpenAlexWikidataFDO

Authors Kiem-Phong Vo

Publication date 1983

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

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

zbMATH Keywords

depth first searchtriconnected component

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Connectivity (05C40)

Cites work

• scientific article; zbMATH DE number 3464839 (Why is no real title available?)
• scientific article; zbMATH DE number 3511563 (Why is no real title available?)
• scientific article; zbMATH DE number 3236772 (Why is no real title available?)
• A structural characterization of planar combinatorial graphs
• An Algorithm for Determining Whether the Connectivity of a Graph is at Leastk
• Depth-First Search and Linear Graph Algorithms
• Embedding Graphs in the Plane—Algorithmic Aspects
• Network Flow and Testing Graph Connectivity
• Segment graphs, depth-first cycle bases, 3-connectivity, and planarity of graphs

Cited in

(10)

• A matrix analysis of carrier posets of biconnected graphs
• Searching forK_3,3in linear time
• Every DFS Tree of a 3‐Connected Graph Contains a Contractible Edge
• Tractable minor-free generalization of planar zero-field Ising models
• An approach to the subgraph homeomorphism problem
• On finding optimal and near-optimal lineal spanning trees
• Polynomial-time classification of skew-symmetrizable matrices with a positive definite quasi-Cartan companion
• Ranking and unranking planar embeddings
• Determining when a graphic matroid is transversal in linear time
• Construction sequences and certifying 3-connectivity

This page was built for publication: Finding triconnected components of graphs

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