2 citations · 3 across the 8 of their papers we have counts for
12 papers
Basis Number and Pathwidth
Babak Miraftab, Pat Morin, Yelena Yuditsky
We prove two results relating the basis number of a graph to path decompositions of . Our first result shows that the basis number of a graph is at most four times its pathw…
The asymptotic -boundedness of hereditary families
Bruce Reed, Yelena Yuditsky
A family of graphs is asymptotically -bounded with bounding function if almost every graph in the family satisfies . A graph is -free if…
Typical -free graphs
Bruce Reed, Yelena Yuditsky
We prove that for every tree which is not an edge, for almost every graph which does not contain as an induced subgraph, has a partition into parts cert…
Face covers and rooted minors in bounded genus graphs
Samuel Fiorini, Stefan Kober, Michał T. Seweryn +2
A {\em rooted graph} is a graph together with a designated vertex subset, called the {\em roots}. In this paper, we consider rooted graphs embedded in a fixed surface. A collection…
On graph classes with constant domination-packing ratio
Marthe Bonamy, Mónika Csikós, Anna Gujgiczer +1
The dominating number of a graph is the minimum size of a vertex set whose closed neighborhood covers all the vertices of the graph. The packing number of is…
Integer programs with nearly totally unimodular matrices: the cographic case
Manuel Aprile, Samuel Fiorini, Gwenaël Joret +4
It is a notorious open question whether integer programs (IPs), with an integer coefficient matrix whose subdeterminants are all bounded by a constant in absolute value, ca…