Snarks with given real flow numbers
From MaRDI portal
Recommendations
- Real flow number and the cycle rank of a graph
- Snarks and flow-snarks constructed from coloring-snarks.
- A unified approach to construct snarks with circular flow number 5
- The crossing number of flower snarks and related graphs
- On generating snarks
- scientific article; zbMATH DE number 867669
- Snarks with resistance \(n\) and flow resistance \(2n\)
- scientific article; zbMATH DE number 6472882
- Nowhere-zero 5-flows and (1, 2)-factors
- Nowhere-zero 5-flows
Cites work
- A Contribution to the Theory of Chromatic Polynomials
- Circular chromatic number: A survey
- Circular flow numbers of regular multigraphs
- Coloring-flow duality of embedded graphs
- Construction of graphs with given circular flow numbers
- Flows and generalized coloring theorems in graphs
- On (k,d)-colorings and fractional nowhere-zero flows
- On Tutte's extension of the four-colour problem
- On the strong circular 5‐flow conjecture
- Reduction of the 5-flow conjecture to cyclically 6-edge-connected snarks.
- Restrictions on smallest counterexamples to the 5-flow conjecture
- Tutte's 5-flow conjecture for graphs of nonorientable genus 5
Cited in
(18)- Circular flow number of Goldberg snarks
- Snarks and flow-snarks constructed from coloring-snarks.
- Flow number and circular flow number of signed cubic graphs
- Flow resistance to resistance ratios in cubic graphs
- Superposition of snarks revisited
- Non-trivial snarks with given circular chromatic index
- The Set of Circular Flow Numbers of Regular Graphs
- Real flow number and the cycle rank of a graph
- A faster test for 4-flow-criticality in snarks
- Hypohamiltonian snarks have a 5-flow
- Measures of edge-uncolorability of cubic graphs
- Computational results and new bounds for the circular flow number of snarks
- A unified approach to construct snarks with circular flow number 5
- On \(\mathbb{Z}\)-flow-continuous maps and oriented colorings of cubic graphs
- Flow number and circular flow number of signed cubic graphs
- The crossing number of flower snarks and related graphs
- Circular flow numbers of regular multigraphs
- Snarks with resistance \(n\) and flow resistance \(2n\)
This page was built for publication: Snarks with given real flow numbers
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3096956)
