On Sylvester Colorings of Cubic Graphs

zbMath1405.05061arXiv1511.02475MaRDI QIDQ4622633

Vahan V. Mkrtchyan, Anush Hakobyan

Publication date: 13 February 2019

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

zbMATH Keywords

Sylvester coloring conjecturePetersen coloring conjecture of Jaeger states

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15)

Related Items (3)

On the existence of graphs which can colour every regular graph ⋮ Disjoint odd circuits in a bridgeless cubic graph can be quelled by a single perfect matching ⋮ S_12 and P_12-colorings of cubic graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Perfect matchings in claw-free cubic graphs
• Matching theory
• Classification and characterizations of snarks
• Measurements of edge-uncolorability
• Combinatorial optimization. Polyhedra and efficiency (3 volumes)
• On parsimonious edge-colouring of graphs with maximum degree three
• A remark on Petersen coloring conjecture of Jaeger
• On Multi-Colourings of Cubic Graphs, and Conjectures of Fulkerson and Tutte
• Blocking and anti-blocking pairs of polyhedra

This page was built for publication: On Sylvester Colorings of Cubic Graphs