Geodesic
A note on forbidding clique immersions
The electronic journal of combinatorics, Tome 20 (2013) no. 3
Cet article a éte moissonné depuis la source The Electronic Journal of Combinatorics website

Voir la notice de l'article

Robertson and Seymour proved that the relation of graph immersion is well-quasi-ordered for finite graphs. Their proof uses the results of graph minors theory. Surprisingly, there is a very short proof of the corresponding rough structure theorem for graphs without $K_t$-immersions; it is based on the Gomory-Hu theorem. The same proof also works to establish a rough structure theorem for Eulerian digraphs without $\vec{K}_t$-immersions, where $\vec{K}_t$ denotes the bidirected complete digraph of order $t$.
DOI : 10.37236/2533
Classification : 05C75, 05C69 
@article{10_37236_2533,
     author = {Matt DeVos and Jessica McDonald and Bojan Mohar and Diego Scheide},
     title = {A note on forbidding clique immersions},
     journal = {The electronic journal of combinatorics},
     year = {2013},
     volume = {20},
     number = {3},
     doi = {10.37236/2533},
     zbl = {1295.05194},
     url = {http://geodesic.mathdoc.fr/articles/10.37236/2533/}
}
TY  - JOUR
AU  - Matt DeVos
AU  - Jessica McDonald
AU  - Bojan Mohar
AU  - Diego Scheide
TI  - A note on forbidding clique immersions
JO  - The electronic journal of combinatorics
PY  - 2013
VL  - 20
IS  - 3
UR  - http://geodesic.mathdoc.fr/articles/10.37236/2533/
DO  - 10.37236/2533
ID  - 10_37236_2533
ER  - 
%0 Journal Article
%A Matt DeVos
%A Jessica McDonald
%A Bojan Mohar
%A Diego Scheide
%T A note on forbidding clique immersions
%J The electronic journal of combinatorics
%D 2013
%V 20
%N 3
%U http://geodesic.mathdoc.fr/articles/10.37236/2533/
%R 10.37236/2533
%F 10_37236_2533
Matt DeVos; Jessica McDonald; Bojan Mohar; Diego Scheide. A note on forbidding clique immersions. The electronic journal of combinatorics, Tome 20 (2013) no. 3. doi: 10.37236/2533

Cité par Sources :