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

Connectivity of Planar Graphs

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

DOI10.7155/jgaa.00041zbMath0986.05066OpenAlexW2032168476MaRDI QIDQ2755060

Patrice Ossona de Mendez, Hubert de Fraysseix

Publication date: 7 January 2002

Published in: Journal of Graph Algorithms and Applications (Search for Journal in Brave)

Full work available at URL: https://eudml.org/doc/49191


zbMATH Keywords

planar graphslinear-time algorithms


Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Graph algorithms (graph-theoretic aspects) (05C85) Connectivity (05C40)


Related Items (1)

Domination of maximal \(K_4\)-minor free graphs and maximal \(K_{2, 3}\)-minor free graphs, and disproofs of two conjectures on planar graphs




This page was built for publication: Connectivity of Planar Graphs

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:2755060&oldid=15631697"
Tools
What links here
Related changes
Special pages
Printable version
Permanent link
Page information
MaRDI portal item
This page was last edited on 3 February 2024, at 14:24.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki