Some results on the structure of multipoles in the study of snarks

zbMath1308.05049arXiv1308.0480MaRDI QIDQ2260618

Yanyan Li

Publication date: 11 March 2015

Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)

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

zbMATH Keywords

statescycleedge-coloringcubic graphparity lemmalinear recurrenceirreduciblesnarkseparablemultipolecolor closedcolor complete

Mathematics Subject Classification ID

Trees (05C05) Paths and cycles (05C38) Coloring of graphs and hypergraphs (05C15)

Related Items (2)

Measures of edge-uncolorability of cubic graphs ⋮ Simple cubic graphs with no short traveling salesman tour

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Construction of class two graphs with maximum vertex degree three
• Classification and characterizations of snarks
• 6-decomposition of snarks
• Snarks without small cycles
• A simple and fast heuristic algorithm for edge-coloring of graphs
• Decomposition of snarks
• Infinite Families of Nontrivial Trivalent Graphs Which are Not Tait Colorable
• Decompositions and reductions of snarks

This page was built for publication: Some results on the structure of multipoles in the study of snarks