4 papers · 1 filter
Biclique decompositions from Welzl orders
Jean Cardinal, Rose McCarty, Yelena Yuditsky
A biclique decomposition of a graph is a partition of its edges into complete bipartite subgraphs. We consider graphs whose vertices can be ordered such that the neighborhood of ev…
The structure of group-labeled graphs forbidding an immersion
Rose McCarty, Caleb McFarland, Paul Wollan
A -labeled graph is an oriented graph with edges invertibly labeled by a group . We prove a structure theorem for -labeled graphs which forbid a fixed -labeled grap…
Graphs whose Eulerian trails have unique labels
Donggyu Kim, Rose McCarty, Caleb McFarland
Consider an undirected graph whose edges are labeled invertibly in a group. When does every Eulerian trail from one fixed vertex to another have the same label? We give a precise s…
Excluding a clique or a biclique in graphs of bounded induced matching treewidth
Tara Abrishami, Marcin BriaÅski, Jadwiga Czyżewska +4
For a tree decomposition of a graph , let denote the maximum size of an induced matching in with the property that some bag of …