Berge–Fulkerson coloring for C(12)‐linked permutation graphs

DOI10.1002/JGT.22720MaRDI QIDQ6056765zbMATH OpenOpenAlexFDO

Authors Siyan Liu, Rong-Xia Hao, Cun-Quan Zhang, Zhang Zhang

Publication date 4 October 2023

Published in Journal of Graph Theory (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1002/jgt.22720

zbMATH Keywords

Berge-Fulkerson coloringBerge-Fulkerson conjectureperfect matchingsnark

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15)

Recommendations

• Berge-Fulkerson coloring for \(C_{(8)}\)-linked graphs
• A note on Berge-Fulkerson coloring
• Berge-Fulkerson coloring for infinite families of snarks
• Berge-Fulkerson coloring for some families of superposition snarks
• Berge-Fulkerson conjecture on certain snarks

Cites work

• A note on Berge-Fulkerson coloring
• Berge-Fulkerson coloring for \(C_{(8)}\)-linked graphs
• Berge-Fulkerson conjecture on certain snarks
• Blocking and anti-blocking pairs of polyhedra
• Construction of permutation snarks
• Covering Graphs by Cycles
• Fulkerson's conjecture and circuit covers
• Fulkerson-covers of hypohamiltonian graphs
• Generation and properties of snarks
• Graph theory
• Odd 2-factored snarks
• On Multi-Colourings of Cubic Graphs, and Conjectures of Fulkerson and Tutte
• Reduction of the Berge-Fulkerson conjecture to cyclically 5-edge-connected snarks
• Shortest coverings of graphs with cycles
• The equivalence of two conjectures of Berge and Fulkerson

Cited in

(1)

• Berge-Fulkerson coloring for \(C_{(8)}\)-linked graphs

This page was built for publication: Berge–Fulkerson coloring for C(12)‐linked permutation graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6056765)