Geodesic
Cyclically 5-edge connected non-bicritical critical snarks
Discussiones Mathematicae. Graph Theory, Tome 19 (1999) no. 1, pp. 5-11

Voir la notice de l'article provenant de la source Library of Science

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.
Keywords: cubic graphs, snarks, edge colorings 
@article{DMGT_1999_19_1_a0,
     author = {Gr\"unewald, Stefan and Steffen, Eckhard},
     title = {Cyclically 5-edge connected non-bicritical critical snarks},
     journal = {Discussiones Mathematicae. Graph Theory},
     pages = {5--11},
     publisher = {mathdoc},
     volume = {19},
     number = {1},
     year = {1999},
     language = {en},
     url = {http://geodesic.mathdoc.fr/item/DMGT_1999_19_1_a0/}
}
TY  - JOUR
AU  - Grünewald, Stefan
AU  - Steffen, Eckhard
TI  - Cyclically 5-edge connected non-bicritical critical snarks
JO  - Discussiones Mathematicae. Graph Theory
PY  - 1999
SP  - 5
EP  - 11
VL  - 19
IS  - 1
PB  - mathdoc
UR  - http://geodesic.mathdoc.fr/item/DMGT_1999_19_1_a0/
LA  - en
ID  - DMGT_1999_19_1_a0
ER  - 
%0 Journal Article
%A Grünewald, Stefan
%A Steffen, Eckhard
%T Cyclically 5-edge connected non-bicritical critical snarks
%J Discussiones Mathematicae. Graph Theory
%D 1999
%P 5-11
%V 19
%N 1
%I mathdoc
%U http://geodesic.mathdoc.fr/item/DMGT_1999_19_1_a0/
%G en
%F DMGT_1999_19_1_a0
Grünewald, Stefan; Steffen, Eckhard. Cyclically 5-edge connected non-bicritical critical snarks. Discussiones Mathematicae. Graph Theory, Tome 19 (1999) no. 1, pp. 5-11. http://geodesic.mathdoc.fr/item/DMGT_1999_19_1_a0/