A note on Berge-Fulkerson coloring

DOI10.1016/j.disc.2008.12.024zbMath1209.05084OpenAlexW2008271772MaRDI QIDQ1043939

Jianbing Niu, Cun-Quan Zhang, Taoye Zhang, Rong-xia Hao, Xiao-Feng Wang

Publication date: 10 December 2009

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

Full work available at URL: https://doi.org/10.1016/j.disc.2008.12.024

zbMATH Keywords

edge-coloringcubic graphsnarkperfect matchingFulkerson coloring

Mathematics Subject Classification ID

Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Coloring of graphs and hypergraphs (05C15)

Related Items (14)

On Perfect Matching Coverings and Even Subgraph Coverings ⋮ Covering a cubic graph by 5 perfect matchings ⋮ On excessive index of certain networks ⋮ Berge–Fulkerson coloring for C(12)‐linked permutation graphs ⋮ Reduction of the Berge-Fulkerson conjecture to cyclically 5-edge-connected snarks ⋮ Unique Fulkerson coloring of Petersen minor-free cubic graphs ⋮ Fulkerson's conjecture and Loupekine snarks ⋮ Perfect matching covers of cubic graphs of oddness 2 ⋮ Berge-Fulkerson coloring for infinite families of snarks ⋮ Rotation snark, Berge-Fulkerson conjecture and Catlin's 4-flow reduction ⋮ Berge-Fulkerson coloring for some families of superposition snarks ⋮ Berge-Fulkerson conjecture on certain snarks ⋮ Fulkerson-covers of hypohamiltonian graphs ⋮ A class of cubic graphs satisfying Berge conjecture

Cites Work

• Unnamed Item
• Unnamed Item
• Shortest coverings of graphs with cycles
• Construction of class two graphs with maximum vertex degree three
• Short cycle covers and the cycle double cover conjecture
• Fulkerson's conjecture and circuit covers
• The rise and fall of the critical graph conjecture
• Covering Graphs by Cycles
• Infinite Families of Nontrivial Trivalent Graphs Which are Not Tait Colorable
• On Multi-Colourings of Cubic Graphs, and Conjectures of Fulkerson and Tutte
• Maximum matching and a polyhedron with 0,1-vertices
• Polyhedral decompositions of cubic graphs
• Blocking and anti-blocking pairs of polyhedra

This page was built for publication: A note on Berge-Fulkerson coloring