Segment graphs, depth-first cycle bases, 3-connectivity, and planarity of graphs
From MaRDI portal
Publication:3659804
DOI10.1080/03081088308817512zbMath0514.05029OpenAlexW2073443334MaRDI QIDQ3659804
Publication date: 1983
Published in: Linear and Multilinear Algebra (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/03081088308817512
Graph theory (including graph drawing) in computer science (68R10) Planar graphs; geometric and topological aspects of graph theory (05C10) Connectivity (05C40)
Related Items
Searching forK3,3in linear time, Ranking and unranking planar embeddings, Determining when a graphic matroid is transversal in linear time, Construction sequences and certifying 3-connectivity, Every DFS Tree of a 3‐Connected Graph Contains a Contractible Edge, Certifying 3-edge-connectivity, Finding triconnected components of graphs
Cites Work