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

On the structure of a \(k\)-connected graph

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

zbMath1032.05075MaRDI QIDQ1405608

D. Massart

Publication date: 1 September 2003

Published in: Journal of Mathematical Sciences (New York) (Search for Journal in Brave)

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


zbMATH Keywords

connected graph\(k\)-connectivityblock tree


Mathematics Subject Classification ID

Connectivity (05C40)


Related Items (4)

Decomposition of a 2-connected graph into three connected subgraphs ⋮ On semi-reconstruction of graphs of connectivity 2 ⋮ Large contractible subgraphs of a 3-connected graph ⋮ Unnamed Item






This page was built for publication: On the structure of a \(k\)-connected graph

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