Circular flow number of Goldberg snarks
From MaRDI portal
Publication:6136676
Abstract: A circular nowhere-zero -flow on a bridgeless graph is an orientation of the edges and an assignment of real values from to the edges in such a way that the sum of incoming values equals the sum of outgoing values for every vertex. The circular flow number of is the infimum over all values such that admits a nowhere-zero -flow. We prove that the circular glow number of Goldberg snark is , proving a conjecture of Goedgebeur, Mattiolo, and Mazzuoccolo.
Recommendations
- Circular flow number of generalized Blanuša snarks
- Computational results and new bounds for the circular flow number of snarks
- Circular flow numbers of regular multigraphs
- The structure of graphs with circular flow number 5 or more, and the complexity of their recognition problem
- On the strong circular 5‐flow conjecture
Cites work
- scientific article; zbMATH DE number 1432797 (Why is no real title available?)
- A Contribution to the Theory of Chromatic Polynomials
- Balanced Valuations and Flows in Multigraphs
- Circular flow number of generalized Blanuša snarks
- Circular flow numbers of regular multigraphs
- Computational results and new bounds for the circular flow number of snarks
- Determining the circular flow number of a cubic graph
- On (k,d)-colorings and fractional nowhere-zero flows
- Real flow number and the cycle rank of a graph
- Snarks with given real flow numbers
This page was built for publication: Circular flow number of Goldberg snarks
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6136676)