Properties of uniformly \(3\)-connected graphs

DOI10.46298/dmtcs.10407zbMATH Open1547.05151MaRDI QIDQ6599816

Frank Göring, Tobias Hofmann

Publication date: 6 September 2024

Published in: Discrete Mathematics and Theoretical Computer Science. DMTCS (Search for Journal in Brave)

zbMATH Keywords

treewidthcrossing numbergraph constructionsuniform connectivityvertices of minimum degree

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Connectivity (05C40) Vertex degrees (05C07)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• The treewidth of line graphs
• The challenges of unbounded treewidth in parameterised subgraph counting problems
• Linear time algorithms for NP-hard problems restricted to partial k- trees
• Zur Struktur minimal n-fach zusammenhängender Graphen
• A partial k-arboretum of graphs with bounded treewidth
• On interval routing schemes and treewidth
• The average connectivity of a graph
• Graph Classes: A Survey
• Coloring Graphs with Constraints on Connectivity
• A theorem on n-connected graphs

This page was built for publication: Properties of uniformly \(3\)-connected graphs