Separation of vertices by a circuit

DOI10.1016/0012-365X(75)90032-1MaRDI QIDQ1218436zbMATH OpenFDO

Authors William T. Tutte

Publication date 1975

Published in Discrete Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0012-365X(75)90032-1

Mathematics Subject Classification ID

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

Cites work

• Convex Representations of Graphs
• How to Draw a Graph
• scientific article; zbMATH DE number 3236772 (Why is no real title available?)
• scientific article; zbMATH DE number 3241107 (Why is no real title available?)
• scientific article; zbMATH DE number 3365295 (Why is no real title available?)

Cited in

(7)

• Planarity and duality of finite and infinite graphs
• On separating cycles in graphs
• Depth-first search in directed planar graphs, revisited
• Graphs with at most one crossing
• Crossing and Weighted Crossing Number of Near-Planar Graphs
• Spanning trees with nonseparating paths
• Crossing number 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)