Normal 6-edge-colorings of some bridgeless cubic graphs

DOI10.1016/j.dam.2019.09.019zbMath1448.05076arXiv1903.06043OpenAlexW2979850371WikidataQ127081881 ScholiaQ127081881MaRDI QIDQ2306603

Giuseppe Mazzuoccolo, Vahan V. Mkrtchyan

Publication date: 23 March 2020

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

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

zbMATH Keywords

cubic graphclass of snarksnormal edge-coloringPetersen coloring conjecture

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15)

Related Items

Partially normal 5-edge-colorings of cubic graphs ⋮ Variations on the Petersen colouring conjecture

Cites Work

• Perfect matchings in claw-free cubic graphs
• Treelike snarks
• On cycle permutation graphs
• Flows and generalized coloring theorems in graphs
• The strong chromatic index of a cubic graph is at most 10
• Colouring of cubic graphs by Steiner triple systems
• Variations on the Petersen colouring conjecture
• Über simpliziale Zerfällungen beliebiger (endlicher oder unendlicher) Graphen
• A remark on Petersen coloring conjecture of Jaeger
• Petersen-colorings and some families of snarks
• On Multi-Colourings of Cubic Graphs, and Conjectures of Fulkerson and Tutte
• Halin graphs and the travelling salesman problem
• Normal edge‐colorings of cubic graphs
• Blocking and anti-blocking pairs of polyhedra
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Normal 6-edge-colorings of some bridgeless cubic graphs