The maximum average connectivity among all orientations of a graph
From MaRDI portal
Publication:2125229
DOI10.1007/s10878-021-00789-zzbMath1491.05115arXiv1907.07219OpenAlexW3193374719MaRDI QIDQ2125229
Peter Dankelmann, Rocio M. Casablanca, Wayne Goddard, L. A. S. Mól, Ortrud R. Oellermann
Publication date: 13 April 2022
Published in: Journal of Combinatorial Optimization (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1907.07219
connectivitycubic graphsorientationsaverage connectivityminimally 2-connected graphsmaximal outerplanar graphs
Extremal problems in graph theory (05C35) Planar graphs; geometric and topological aspects of graph theory (05C10) Connectivity (05C40)
Related Items (2)
On orientations maximizing total arc-connectivity ⋮ Extremal graphs for average sizes of maximal matchings
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Strongly 2-connected orientations of graphs
- Bounds on the average connectivity of a graph
- The average connectivity of a graph
- The average connectivity of a digraph
- Average connectivity of minimally 2-connected graphs and average edge-connectivity of minimally 2-edge-connected graphs
- On Frank's conjecture on \(k\)-connected orientations
- Ecken vom Grad \(n\) in minimalen \(n\)-fach zusammenhängenden Graphen
- Tough graphs and Hamiltonian circuits.
- On Orientations, Connectivity and Odd-Vertex-Pairings in Finite Graphs
- A Reduction Method for Edge-Connectivity in Graphs
- Minimally 2-connected graphs.
- On Minimal Blocks
- A Theorem on Graphs, with an Application to a Problem of Traffic Control
This page was built for publication: The maximum average connectivity among all orientations of a graph