Classification and characterizations of snarks

DOI10.1016/S0012-365X(97)00255-0zbMath0956.05089WikidataQ56429222 ScholiaQ56429222MaRDI QIDQ1584327

Eckhard Steffen

Publication date: 2 November 2000

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

zbMATH Keywords

characterizations; distance; snarks; 3-colorable graph; vertex-reductions

Mathematics Subject Classification ID

05C75: Structural characterization of families of graphs

05C15: Coloring of graphs and hypergraphs

Related Items

Unnamed Item, 1‐Factor and Cycle Covers of Cubic Graphs, On snarks that are far from being 3-edge colorable, Hypohamiltonian snarks have a 5-flow, Edge-colourings of cubic graphs admitting a solvable vertex-transitive group of automorphisms, Three measures of edge-uncolorability, On resistance of graphs, Measures of edge-uncolorability, Fano colourings of cubic graphs and the Fulkerson conjecture, Color-character of uncolorable cubic graphs, The P versus NP-complete dichotomy of some challenging problems in graph theory, 6-decomposition of snarks, Measurements of edge-uncolorability, Some results on the structure of multipoles in the study of snarks, Small snarks with large oddness, Chromatic index of graphs with no cycle with a unique chord, Nowhere-zero flows on signed regular graphs, On parsimonious edge-colouring of graphs with maximum degree three, Irreducible snarks of given order and cyclic connectivity, Maximum Δ-edge-colorable subgraphs of class II graphs, Petersen Cores and the Oddness of Cubic Graphs, Minimal edge colorings of class 2 graphs and double graphs, Cubic Graphs with Large Circumference Deficit, Hypohamiltonian Snarks with Cyclic Connectivity 5 and 6, Decompositions of Snarks into Repeated Dot-Products, Some Topics in Graph Theory

Cites Work

• Large Isaacs' graphs are maximally non-Hamilton-connected
• Construction of class two graphs with maximum vertex degree three
• Five cycle double covers of some cubic graphs
• Snarks without small cycles
• Decomposition of snarks
• Infinite Families of Nontrivial Trivalent Graphs Which are Not Tait Colorable
• A theorem on tait colorings with an application to the generalized Petersen graphs
• Polyhedral decompositions of cubic graphs
• Network-Colourings
• On cycle-double covers of graphs of small oddness
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item