Geodesic
Ear decompositions in combed graphs
The electronic journal of combinatorics, Tome 15 (2008)
Cet article a éte moissonné depuis la source The Electronic Journal of Combinatorics website

Voir la notice de l'article

We introduce the concept of combed graphs and present an ear decomposition theorem for this class of graphs. This theorem includes the well known ear decomposition theorem for matching covered graphs proved by Lovász and Plummer. Then we use the ear decomposition theorem to show that any two edges of a 2-connected combed graph lie in a balanced circuit of an equivalent combed graph. This result generalises the theorem that any two edges in a matching covered graph with at least four vertices belong to an alternating circuit.
DOI : 10.37236/743
Classification : 05C70
Mots-clés : combed graphs, ear decomposition, matching covered graphs, alternating citcuit 
@article{10_37236_743,
     author = {Marcelo H. de Carvalho and C. H. C. Little},
     title = {Ear decompositions in combed graphs},
     journal = {The electronic journal of combinatorics},
     year = {2008},
     volume = {15},
     doi = {10.37236/743},
     zbl = {1180.05086},
     url = {http://geodesic.mathdoc.fr/articles/10.37236/743/}
}
TY  - JOUR
AU  - Marcelo H. de Carvalho
AU  - C. H. C. Little
TI  - Ear decompositions in combed graphs
JO  - The electronic journal of combinatorics
PY  - 2008
VL  - 15
UR  - http://geodesic.mathdoc.fr/articles/10.37236/743/
DO  - 10.37236/743
ID  - 10_37236_743
ER  - 
%0 Journal Article
%A Marcelo H. de Carvalho
%A C. H. C. Little
%T Ear decompositions in combed graphs
%J The electronic journal of combinatorics
%D 2008
%V 15
%U http://geodesic.mathdoc.fr/articles/10.37236/743/
%R 10.37236/743
%F 10_37236_743
Marcelo H. de Carvalho; C. H. C. Little. Ear decompositions in combed graphs. The electronic journal of combinatorics, Tome 15 (2008). doi: 10.37236/743

Cité par Sources :