Download PDF - On generating snarks
ArticleOriginal scientific text
Title
On generating snarks
Authors 1
Affiliations
- Department of Mathematical Sciences, Chancellor College, P.O. Box 280, Zomba, Malawi
Abstract
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.
Keywords
snarks, cubic graphs, sirth, edge colouring
Bibliography
- J.A. Bondy and U.S.R. Murty, Graph Theory with Applications (American Elsevier, New York, 1976).
- B. Jackson, On cycle Covers, cycle Decompositions and Euler Tours of Graphs, Preprint (1993).
- 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).
- 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.
- 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.
Pages:
147-158
Main language of publication
English
Received
1997-08-22
Accepted
1998-05-02
Published
1998
DOI: 10.7151/dmgt.1070
Exact and natural sciences