Vector spaces and the Petersen graph
The electronic journal of combinatorics, Tome 15 (2008)

Voir la notice de l'article provenant de la source The Electronic Journal of Combinatorics website

Zbl EuDML
It is shown that a matching covered graph has an ear decomposition with no more than one double ear if and only if there is no set $S$ of edges such that $|S \cap A|$ is even for every alternating circuit $A$ but $|S \cap C|$ is odd for some even circuit $C$. Two proofs are presented. The first uses vector spaces and the second is constructive. Some applications are also given.
DOI : 10.37236/733
Classification : 05C70
Mots-clés : matching covered graph, ear decomposition
Marcelo H. de Carvalho; C. H. C. Little. Vector spaces and the Petersen graph. The electronic journal of combinatorics, Tome 15 (2008). doi: 10.37236/733
@article{10_37236_733,
     author = {Marcelo H. de Carvalho and C. H. C. Little},
     title = {Vector spaces and the {Petersen} graph},
     journal = {The electronic journal of combinatorics},
     year = {2008},
     volume = {15},
     doi = {10.37236/733},
     zbl = {1180.05085},
     url = {http://geodesic.mathdoc.fr/articles/10.37236/733/}
}
TY  - JOUR
AU  - Marcelo H. de Carvalho
AU  - C. H. C. Little
TI  - Vector spaces and the Petersen graph
JO  - The electronic journal of combinatorics
PY  - 2008
VL  - 15
UR  - http://geodesic.mathdoc.fr/articles/10.37236/733/
DO  - 10.37236/733
ID  - 10_37236_733
ER  - 
%0 Journal Article
%A Marcelo H. de Carvalho
%A C. H. C. Little
%T Vector spaces and the Petersen graph
%J The electronic journal of combinatorics
%D 2008
%V 15
%U http://geodesic.mathdoc.fr/articles/10.37236/733/
%R 10.37236/733
%F 10_37236_733

Cité par Sources :