Geodesic
More forbidden minors for wye-delta-wye reducibility
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

A graph is $Y\Delta Y$ reducible if it can be reduced to isolated vertices by a sequence of series-parallel reductions and $Y\Delta Y$ transformations. It is still an open problem to characterize $Y\Delta Y$ reducible graphs in terms of a finite set of forbidden minors. We obtain a characterization of such forbidden minors that can be written as clique $k$-sums for $k=1, 2, 3$. As a result we show constructively that the total number of forbidden minors is more than 68 billion up to isomorphism.
DOI : 10.37236/1033
Classification : 05C75, 05C83
Mots-clés : series-parallel reductions, transformations, characterization 
@article{10_37236_1033,
     author = {Yaming Yu},
     title = {More forbidden minors for wye-delta-wye reducibility},
     journal = {The electronic journal of combinatorics},
     year = {2006},
     volume = {13},
     doi = {10.37236/1033},
     zbl = {1080.05080},
     url = {http://geodesic.mathdoc.fr/articles/10.37236/1033/}
}
TY  - JOUR
AU  - Yaming Yu
TI  - More forbidden minors for wye-delta-wye reducibility
JO  - The electronic journal of combinatorics
PY  - 2006
VL  - 13
UR  - http://geodesic.mathdoc.fr/articles/10.37236/1033/
DO  - 10.37236/1033
ID  - 10_37236_1033
ER  - 
%0 Journal Article
%A Yaming Yu
%T More forbidden minors for wye-delta-wye reducibility
%J The electronic journal of combinatorics
%D 2006
%V 13
%U http://geodesic.mathdoc.fr/articles/10.37236/1033/
%R 10.37236/1033
%F 10_37236_1033
Yaming Yu. More forbidden minors for wye-delta-wye reducibility. The electronic journal of combinatorics, Tome 13 (2006). doi: 10.37236/1033

Cité par Sources :