Separation of vertices by a circuit
From MaRDI portal
Publication:1218436
DOI10.1016/0012-365X(75)90032-1zbMath0308.05106MaRDI QIDQ1218436
Publication date: 1975
Published in: Discrete Mathematics (Search for Journal in Brave)
Related Items
Depth-first search in directed planar graphs, revisited, Planarity and duality of finite and infinite graphs, Spanning trees with nonseparating paths, Crossing number and weighted crossing number of near-planar graphs, Crossing and Weighted Crossing Number of Near-Planar Graphs, On separating cycles in graphs, Graphs with at most one crossing
Cites Work