Computational results and new bounds for the circular flow number of snarks

DOI10.1016/j.disc.2020.112026zbMath1445.05045arXiv1909.09870OpenAlexW3034892763MaRDI QIDQ785826

Davide Mattiolo, Jan Goedgebeur, Giuseppe Mazzuoccolo

Publication date: 12 August 2020

Published in: Discrete Mathematics (Search for Journal in Brave)

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

zbMATH Keywords

algorithmcubic graphcircular flowsnarkbisectiondot product

Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85) Flows in graphs (05C21)

Related Items

Determining the circular flow number of a cubic graph ⋮ Unnamed Item ⋮ A unified approach to construct snarks with circular flow number 5 ⋮ Ban–Linial's Conjecture and treelike snarks ⋮ Circular flow number of Goldberg snarks ⋮ Some snarks are worse than others ⋮ Measures of edge-uncolorability of cubic graphs

Uses Software

• House of Graphs

Cites Work

• Unnamed Item
• Unnamed Item
• The structure of graphs with circular flow number 5 or more, and the complexity of their recognition problem
• Generation and properties of snarks
• Construction of class two graphs with maximum vertex degree three
• House of Graphs: a database of interesting graphs
• Circular flow number of generalized Blanuša snarks
• Circular flow numbers of regular multigraphs
• Snarks with given real flow numbers
• Colourings of cubic graphs inducing isomorphic monochromatic subgraphs
• Real flow number and the cycle rank of a graph
• Infinite Families of Nontrivial Trivalent Graphs Which are Not Tait Colorable
• Balanced Valuations and Flows in Multigraphs
• On (k,d)-colorings and fractional nowhere-zero flows
• Flows and Bisections in Cubic Graphs
• On the strong circular 5‐flow conjecture
• Polyhedral decompositions of cubic graphs
• A Contribution to the Theory of Chromatic Polynomials