The structure of graphs with circular flow number 5 or more, and the complexity of their recognition problem

DOI10.4310/JOC.2016.v7.n2.a12zbMath1336.05053arXiv1501.03774OpenAlexW3099251377MaRDI QIDQ286768

Michael Tarsi, Louis Esperet, Giuseppe Mazzuoccolo

Publication date: 25 May 2016

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

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

zbMATH Keywords

NP-completenesssnarkscircular flowsnowhere-zero flows

Mathematics Subject Classification ID

Structural characterization of families of graphs (05C75) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Flows in graphs (05C21)

Related Items (6)

Unnamed Item ⋮ A unified approach to construct snarks with circular flow number 5 ⋮ Measures of edge-uncolorability of cubic graphs ⋮ Treelike snarks ⋮ Cubic graphs that cannot be covered with four perfect matchings ⋮ Computational results and new bounds for the circular flow number of snarks

This page was built for publication: The structure of graphs with circular flow number 5 or more, and the complexity of their recognition problem