2 citations · 4 across the 3 of their papers we have counts for
4 papers
The extremal function for disconnected minors
Endre Csóka, Irene Lo, Sergey Norin +2
For a graph let denote the supremum of taken over all non-null graphs not containing as a minor. We show that $$c(H) \leq \frac{|V(H)|+\mathrm{co…
Coloring Square-free Berge Graphs
Maria Chudnovsky, Irene Lo, Frederic Maffray +2
We consider the class of Berge graphs that do not contain a chordless cycle of length . We present a purely graph-theoretical algorithm that produces an optimal coloring in poly…
Misere Hackenbush Flowers
Irene Y. Lo
We show that any disjunctive sum of Hackenbush Flowers has as evil twin such that the outcomes of under normal and misère play are the same as the outcom…
Some Bounds on the Rainbow Connection Number of 3-, 4- and 5-connected Graphs
Irene Y. Lo
The rainbow connection number, , of a connected graph is the minimum number of colors needed to color its edges so that every pair of vertices is connected by at least o…