Improved upper bound on the Frank number of 3-edge-connected graphs
Work
Year: 2024
Type: article
Abstract: In an orientation O of the graph G, an arc e is deletable if and only if O−e is strongly connected. For a 3-edge-connected graph G, the Frank number is the minimum k for which G admits k strongly conn... more
Authors János Barát, Zoltán L. Blázsik
Institutions University of Pannonia, Alfréd Rényi Institute of Mathematics, Eötvös Loránd University
Cites: 7
Cited by: 1
Related to: 10
FWCI: 1.199
Citation percentile (by year/subfield): 76.37
Subfield: Computational Theory and Mathematics
Field: Computer Science
Domain: Physical Sciences
Open Access status: hybrid
APC paid (est): $2,880