Geodesic
Parity versions of 2-connectedness
The electronic journal of combinatorics, Tome 13 (2006)
Cet article a éte moissonné depuis la source The Electronic Journal of Combinatorics website

Voir la notice de l'article

This paper introduces parity versions of familiar graph theoretic results, in particular results related to 2-connectedness. The even and odd circuit connected graphs are characterized. The realizable, even-realizable, alternating-realizable, dual realizable and dual even-realizable graphs are classified.
DOI : 10.37236/1122
Classification : 05C40, 05C38 
@article{10_37236_1122,
     author = {C. Little and A. Vince},
     title = {Parity versions of 2-connectedness},
     journal = {The electronic journal of combinatorics},
     year = {2006},
     volume = {13},
     doi = {10.37236/1122},
     zbl = {1115.05052},
     url = {http://geodesic.mathdoc.fr/articles/10.37236/1122/}
}
TY  - JOUR
AU  - C. Little
AU  - A. Vince
TI  - Parity versions of 2-connectedness
JO  - The electronic journal of combinatorics
PY  - 2006
VL  - 13
UR  - http://geodesic.mathdoc.fr/articles/10.37236/1122/
DO  - 10.37236/1122
ID  - 10_37236_1122
ER  - 
%0 Journal Article
%A C. Little
%A A. Vince
%T Parity versions of 2-connectedness
%J The electronic journal of combinatorics
%D 2006
%V 13
%U http://geodesic.mathdoc.fr/articles/10.37236/1122/
%R 10.37236/1122
%F 10_37236_1122
C. Little; A. Vince. Parity versions of 2-connectedness. The electronic journal of combinatorics, Tome 13 (2006). doi: 10.37236/1122

Cité par Sources :