2 citations · 4 across the 5 of their papers we have counts for
5 papers · 1 filter
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…
Immersing complete digraphs
Matt DeVos, Jessica McDonald, Bojan Mohar +1
We consider the problem of immersing the complete digraph on t vertices in a simple digraph. For Eulerian digraphs, we show that such an immersion always exists whenever minimum de…
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…
Packing triangles in weighted graphs
Guillaume Chapuy, Matt DeVos, Jessica McDonald +2
Tuza conjectured that for every graph , the maximum size of a set of edge-disjoint triangles and minimum size of a set of edges meeting all triangles satisfy .…
Kempe equivalence of edge-colourings in subcubic and subquartic graphs
Jessica McDonald, Bojan Mohar, Diego Scheide
It is proved that all 4-edge-colourings of a (sub)cubic graph are Kempe equivalent. This resolves a conjecture of the second author. In fact, it is found that the maximum degree De…