Uniformly connected graphs

DOI10.1002/jgt.22820zbMath1522.05247arXiv2103.03767OpenAlexW4221101545MaRDI QIDQ6081585

Manuel Streicher, Tobias Hofmann, Frank Göring

Publication date: 5 October 2023

Published in: Journal of Graph Theory (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2103.03767

zbMATH Keywords

independent pathsgraph constructionsuniform connectivityvertices of minimum degree

Mathematics Subject Classification ID

Structural characterization of families of graphs (05C75) Connectivity (05C40) Vertex degrees (05C07) Extremal combinatorics (05D99)

Related Items (1)

Uniformly 3‐connected graphs

Cites Work

• Unnamed Item
• Unnamed Item
• On the graph structure of convex polyhedra in \(n\)-space
• The vertex-connectivity of a distance-regular graph
• Zur Struktur minimal n-fach zusammenhängender Graphen
• The average connectivity of a graph
• Computing vertex-disjoint paths in large graphs using MAOs
• Edge-connectivity matrices and their spectra
• Graph Theory
• Multi-Terminal Network Flows
• On Connectivity in Matroids and Graphs
• Network Flow and Testing Graph Connectivity
• Tight bounds for the vertices of degree k in minimally k‐connected graphs
• Uniformly Connected Graphs — A Survey
• Minimally 2-connected graphs.
• A theorem on n-connected graphs

This page was built for publication: Uniformly connected graphs