Classification and characterizations of snarks
From MaRDI portal
Publication:1584327
DOI10.1016/S0012-365X(97)00255-0zbMath0956.05089WikidataQ56429222 ScholiaQ56429222MaRDI QIDQ1584327
Publication date: 2 November 2000
Published in: Discrete Mathematics (Search for Journal in Brave)
Structural characterization of families of graphs (05C75) Coloring of graphs and hypergraphs (05C15)
Related Items (43)
Snarks with resistance \(n\) and flow resistance \(2n\) ⋮ On snarks that are far from being 3-edge colorable ⋮ Oddness to resistance ratios in cubic graphs ⋮ On parsimonious edge-colouring of graphs with maximum degree three ⋮ Flows in signed graphs with two negative edges ⋮ Maximum Δ-edge-colorable subgraphs of class II graphs ⋮ Hypohamiltonian snarks have a 5-flow ⋮ Cubic Graphs with Large Circumference Deficit ⋮ 3-critical subgraphs of snarks ⋮ Girth, oddness, and colouring defect of snarks ⋮ Edge-colourings of cubic graphs admitting a solvable vertex-transitive group of automorphisms ⋮ Three measures of edge-uncolorability ⋮ Petersen Cores and the Oddness of Cubic Graphs ⋮ Cubic graphs with colouring defect 3 ⋮ A note on reducing resistance in snarks ⋮ Flow resistance to resistance ratios in cubic graphs ⋮ Reducible 3-critical graphs ⋮ On resistance of graphs ⋮ Measures of edge-uncolorability ⋮ On maximum \(k\)-edge-colorable subgraphs of bipartite graphs ⋮ Critical and flow-critical snarks coincide ⋮ Measures of edge-uncolorability of cubic graphs ⋮ Weak oddness as an approximation of oddness and resistance in cubic graphs ⋮ Unnamed Item ⋮ The P versus NP-complete dichotomy of some challenging problems in graph theory ⋮ 6-decomposition of snarks ⋮ 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 ⋮ Irreducible snarks of given order and cyclic connectivity ⋮ Some Topics in Graph Theory ⋮ The smallest nontrivial snarks of oddness 4 ⋮ On Sylvester Colorings of Cubic Graphs ⋮ Smallest snarks with oddness 4 and cyclic connectivity 4 have order 44 ⋮ 1‐Factor and Cycle Covers of Cubic Graphs ⋮ Measurements of edge-uncolorability ⋮ Color-character of uncolorable cubic graphs ⋮ Minimal edge colorings of class 2 graphs and double graphs ⋮ Nowhere-zero flows on signed regular graphs ⋮ Hypohamiltonian Snarks with Cyclic Connectivity 5 and 6 ⋮ Decompositions of Snarks into Repeated Dot-Products ⋮ Morphology of small snarks ⋮ Fano colourings of cubic graphs and the Fulkerson conjecture
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
- Decompositions and reductions of snarks
- 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
This page was built for publication: Classification and characterizations of snarks
