12 citations · 47 across the 20 of their papers we have counts for
Showing 2012Show all
2 papers · 1 filter
cs.DS2012
Effective Computation of Immersion Obstructions for Unions of Graph Classes
Archontia C. Giannopoulou, Iosif Salem, Dimitris Zoros
In the final paper of the Graph Minors series N. Robertson and P. Seymour proved that graphs are well-quasi-ordered under the immersion ordering. A direct implication of this theor…
math.CO2012★ 3 cited
Forbidding Kuratowski Graphs as Immersions
Archontia C. Giannopoulou, Marcin Kaminski, Dimitrios M. Thilikos
The immersion relation is a partial ordering relation on graphs that is weaker than the topological minor relation in the sense that if a graph contains a graph as a topolo…