Snarks with special spanning trees

Abstract: Let

G

be a cubic graph which has a decomposition into a spanning tree

T

and a

2

-regular subgraph

C

, i.e.

E (T) c u p E (C) = E (G)

and

E (T) c a p E (C) = e m p t y s e t

. We provide an answer to the following question: which lengths can the cycles of

C

have if

G

is a snark? Note that

T

is a hist (i.e. a spanning tree without a vertex of degree two) and that every cubic graph with a hist has the above decomposition.

Recommendations

Cites work

Cited in

(3)

Describes a project that uses

Uses Software

This page was built for publication: Snarks with special spanning trees