2 citations · 2 across the 1 of their papers we have counts for
Showing math.COShow all
2 papers · 1 filter
math.CO2012★ 1 cited
A note on forbidding clique immersions
Matt DeVos, Jessica McDonald, Bojan Mohar +1
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…
math.CO2010★ 2 cited
Average Degree in Graph Powers
Matt DeVos, Jessica McDonald, Diego Scheide
The kth power of a simple graph G, denoted G^k, is the graph with vertex set V(G) where two vertices are adjacent if they are within distance k in G. We are interested in finding l…