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

A construction of 3-connected graphs

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

DOI10.1007/BF02773688zbMath0799.05056OpenAlexW2036000602MaRDI QIDQ1327517

D. W. Barnette

Publication date: 19 June 1994

Published in: Israel Journal of Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf02773688


zbMATH Keywords

recursive construction3-connected graphs


Mathematics Subject Classification ID

Structural characterization of families of graphs (05C75) Connectivity (05C40)


Related Items (3)

Generating the centrally symmetric 3-polyhedral graphs ⋮ Measures of edge-uncolorability of cubic graphs ⋮ Contractible circuits in \(3\)-connected graphs



Cites Work

  • Planarity and duality of finite and infinite graphs
  • Unnamed Item
  • Unnamed Item


This page was built for publication: A construction of 3-connected graphs

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:1327517&oldid=13453645"
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 13:37.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki