scientific article; zbMATH DE number 7352035

zbMath1465.05064MaRDI QIDQ4990130

Davide Mattiolo

Publication date: 28 May 2021

Full work available at URL: http://ajc.maths.uq.edu.au/pdf/79/ajc_v79_p327.pdf

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

\(\mathbb{Z}\)-flowcyclically 4-edge-connected cubic graphs

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15)

Cites Work

• Unnamed Item
• Unnamed Item
• The structure of graphs with circular flow number 5 or more, and the complexity of their recognition problem
• Computational results and new bounds for the circular flow number of snarks
• Construction of class two graphs with maximum vertex degree three
• A remark on Petersen coloring conjecture of Jaeger
• Infinite Families of Nontrivial Trivalent Graphs Which are Not Tait Colorable
• On (k,d)-colorings and fractional nowhere-zero flows
• Cycle‐Continuous Mappings—Order Structure
• On the strong circular 5‐flow conjecture
• A theorem on three-coloring the edges of a trivalent graph
• Blocking and anti-blocking pairs of polyhedra
• A Theorem on Graphs, with an Application to a Problem of Traffic Control
• A Contribution to the Theory of Chromatic Polynomials