Mathematical Research Data Initiative
Main page
Recent changes
Random page
Help about MediaWiki
Create a new Item
Create a new Property
Create a new EntitySchema
Merge two items
In other projects
Discussion
View source
View history
Purge
English
Log in

Separation of vertices by a circuit

From MaRDI portal
Publication:1218436
Jump to:navigation, search

DOI10.1016/0012-365X(75)90032-1zbMath0308.05106MaRDI QIDQ1218436

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)


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

  • Convex Representations of Graphs
  • How to Draw a Graph
  • Unnamed Item
  • Unnamed Item
  • Unnamed Item
Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:1218436&oldid=13286921"
Tools
What links here
Related changes
Special pages
Printable version
Permanent link
Page information
MaRDI portal item
This page was last edited on 31 January 2024, at 07:49.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki