Improved upper bound on the Frank number of 3-edge-connected graphs

DOI10.1016/j.ejc.2023.103913arXiv2305.19050OpenAlexW4390569457MaRDI QIDQ6201894

János Barát, Zoltán L. Blázsik

Publication date: 26 March 2024

Published in: European Journal of Combinatorics (Search for Journal in Brave)

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

zbMATH Keywords

3-edge-connected graphFrank number

Mathematics Subject Classification ID

Directed graphs (digraphs), tournaments (05C20) Connectivity (05C40)

Cites Work

• Flows and generalized coloring theorems in graphs
• Nowhere-zero 6-flows
• Connectivity of orientations of 3-edge-connected graphs
• On Orientations, Connectivity and Odd-Vertex-Pairings in Finite Graphs
• On the algebraic theory of graph colorings
• Unnamed Item
• Unnamed Item

This page was built for publication: Improved upper bound on the Frank number of 3-edge-connected graphs