S_12 and P_12-colorings of cubic graphs

DOI10.26493/1855-3974.1758.410zbMath1435.05076arXiv1807.08138OpenAlexW2987876456MaRDI QIDQ5217082

Vahan V. Mkrtchyan, Anush Hakobyan

Publication date: 21 February 2020

Published in: Ars Mathematica Contemporanea (Search for Journal in Brave)

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

zbMATH Keywords

cubic graphPetersen graphPetersen coloring conjecture\(S_{10}\)-conjecture

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 (6)

Ban–Linial's Conjecture and treelike snarks ⋮ On the existence of graphs which can colour every regular graph ⋮ \(H\)-colorings for 4-regular graphs ⋮ Disjoint odd circuits in a bridgeless cubic graph can be quelled by a single perfect matching ⋮ An equivalent formulation of the Fan-Raspaud Conjecture and related problems ⋮ Variations on the Petersen colouring conjecture

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Perfect matchings in claw-free cubic graphs
• A remark on Petersen coloring conjecture of Jaeger
• On Cubic Bridgeless Graphs Whose Edge-Set Cannot be Covered by Four Perfect Matchings
• On Perfect Matching Coverings and Even Subgraph Coverings
• The NP-Completeness of Edge-Coloring
• On Multi-Colourings of Cubic Graphs, and Conjectures of Fulkerson and Tutte
• On Sylvester Colorings of Cubic Graphs
• Cycle‐Continuous Mappings—Order Structure
• Blocking and anti-blocking pairs of polyhedra

This page was built for publication: S_12 and P_12-colorings of cubic graphs