UNI-MB - logo
UMNIK - logo
 
(UL)
  • A note on forbidding clique immersions [Elektronski vir]
    DeVos, Matt ...
    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$▫.
    Vir: The Electronic journal of combinatorics [Elektronski vir]. - ISSN 1077-8926 (Vol. 20, no. 3, 2013, P55 (5 str.))
    Vrsta gradiva - e-članek
    Leto - 2013
    Jezik - angleški
    COBISS.SI-ID - 16924505

    Povezava(-e):

    http://www.combinatorics.org/ojs/index.php/eljc/article/view/v30i3p55

Vnos na polico