On generating snarks

• Autorzy: Busiso P. Chisala
• Języki publikacji: EN

Abstrakty

EN

We discuss the construction of snarks (that is, cyclically 4-edge connected cubic graphs of girth at least five which are not 3-edge colourable) by using what we call colourable snark units and a welding process.

Słowa kluczowe

EN

snarks; cubic graphs; sirth; edge colouring

Kategorie tematyczne

• 05C15: Coloring of graphs and hypergraphs

• Wydawca: De Gruyter Open
• Czasopismo: Discussiones Mathematicae Graph Theory
• Rocznik: 1998
• Tom: 18
• Numer: 2
• Strony: 147-158

Daty

wydano

1998

otrzymano

1997-08-22

poprawiono

1998-05-02

Twórcy

autor

Busiso P. Chisala

• Department of Mathematical Sciences, Chancellor College, P.O. Box 280, Zomba, Malawi

Bibliografia

• [1] J.A. Bondy and U.S.R. Murty, Graph Theory with Applications (American Elsevier, New York, 1976).
• [2] B. Jackson, On cycle Covers, cycle Decompositions and Euler Tours of Graphs, Preprint (1993).
• [3] F. Jaeger, Nowhere-zero Flow Problems, in: Graph Theory 3, edited by L.W, Beincke and R.J. Wilson (Academic Press Ltd., New York, 1988).
• [4] R. Isaacs, Infinite families of non-trivial trivalent graphs which are not Tait colorable, Amer. Math. Monthly 82 (1975) 221-239, doi: 10.2307/2319844.
• [5] J.J. Watkins and R.J. Wilson, A Survey of snarks, in: Graph Theory, Combinatorics and Applications, Vol. 2, Proceedings of the Sixth Quadrennial International Conference on the Theory and Applications of Graphs, Y. Alavi et. al. (eds) (John Wiley & Sons, 1991) 1129-1144.

Identyfikatory

DOI

10.7151/dmgt.1070