The construction and reduction of strong snarks

DOI10.1016/S0012-365X(96)00256-7zbMath0868.05039MaRDI QIDQ1356495

Philip Sinclair

Publication date: 6 August 1997

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

zbMATH Keywords

snarkcircuit cover

Mathematics Subject Classification ID

Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Structural characterization of families of graphs (05C75)

Related Items

Measures of edge-uncolorability of cubic graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Cycle covers of cubic multigraphs
• Tutte's 3-flow conjecture and short cycle covers
• Shortest coverings of graphs with cycles
• Nowhere-zero 6-flows
• Even circuits in planar graphs
• An additivity theorem for maximum genus of a graph
• Every planar map is four colorable. I: Discharging
• Shortest circuit covers of cubic graphs
• Five cycle double covers of some cubic graphs
• Minimum cycle coverings and integer flows
• Decomposition of snarks
• Infinite Families of Nontrivial Trivalent Graphs Which are Not Tait Colorable
• Graphs with the Circuit Cover Property
• Polyhedral decompositions of cubic graphs