#### Filter Results:

#### Publication Year

1991

2016

#### Publication Type

#### Co-author

#### Key Phrase

#### Publication Venue

Learn More

Snarks are cubic graphs with chromatic index 0 = 4. A snark G is called critical if 0 (G?fv; wg) = 3 for any two adjacent vertices v and w, and it is called bicritical if 0 (G ? fv; wg) = 3 for any two vertices v and w. We construct innnite families of critical snarks which are not bicritical. This solves a problem stated by Nedela and Skoviera in 7].

We develop four constructions for nowhere-zero 5-ows of 3-regular graphs which satisfy special structural conditions. Using these constructions we show a minimal counterexample to Tutte's 5-ow conjecture is of order 44 and therefore every bridgeless graph of nonorientable genus 5 has a nowhere-zero 5-ow. One of the structural properties is formulated in… (More)

Snarks are bridgeless cubic graphs with chromatic index χ = 4. A snark G is called critical if χ (G − {v, w}) = 3, for any two adjacent vertices v and w. For any k ≥ 2 we construct cyclically 5-edge connected critical snarks G having an independent set I of at least k vertices such that χ (G − I) = 4. For k = 2 this solves a problem of Nedela andŠkoviera… (More)

A chromatic-index-critical graph G on n vertices is non-trivial if it has at most b n 2 c edges. We prove that there is no chromatic-index-critical graph of order 12, and that there are precisely two non-trivial chromatic index critical graphs on 11 vertices. Together with known results this implies that there are precisely three non-trivial… (More)