Separation of vertices by a circuit

DOI10.1016/0012-365X(75)90032-1zbMATH Open0308.05106MaRDI QIDQ1218436FDOQ1218436

William T. Tutte

Publication date: 1975

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

Mathematics Subject Classification ID

Planar graphs; geometric and topological aspects of graph theory (05C10)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• How to Draw a Graph
• Title not available (Why is that?)
• Convex Representations of Graphs

Cited In (7)

• Crossing number and weighted crossing number of near-planar graphs
• Graphs with at most one crossing
• Depth-first search in directed planar graphs, revisited
• Planarity and duality of finite and infinite graphs
• On separating cycles in graphs
• Spanning trees with nonseparating paths
• Crossing and Weighted Crossing Number of Near-Planar Graphs

This page was built for publication: Separation of vertices by a circuit

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