1 citations · 1 across the 6 of their papers we have counts for
6 papers
Tree Independence Number IV. Even-hole-free Graphs
Maria Chudnovsky, Peter Gartland, Sepehr Hajebi +2
We prove that the tree independence number of every even-hole-free graph is at most polylogarithmic in its number of vertices. More explicitly, we prove that there exists a constan…
The sandwich problem for odd-hole-free and even-hole-free graphs
Kathie Cameron, Aristotelis Chaniotis, Celina M. H. de Figueiredo +1
For a property of graphs, the -\textsc{Sandwich-Problem}, introduced by Golumbic and Shamir (1993), is the following: Given a pair of graphs …
Graphs of bounded chordality
Aristotelis Chaniotis, Babak Miraftab, Sophie Spirkl
A hole in a graph is an induced subgraph which is a cycle of length at least four. A graph is chordal if it contains no holes. Following McKee and Scheinerman (1993), we define the…
On heroes in digraphs with forbidden induced forests
Alvaro Carbonero, Hidde Koerts, Benjamin Moore +1
We continue a line of research which studies which hereditary families of digraphs have bounded dichromatic number. For a class of digraphs , a hero in i…
Polynomial bounds for chromatic number VII. Disjoint holes
Maria Chudnovsky, Alex Scott, Paul Seymour +1
A hole in a graph is an induced cycle of length at least four, and a -multihole in is a set of pairwise disjoint and nonadjacent holes. It is well known that if does…
Fast Prefix Adders for Non-Uniform Input Arrival Times
Stephan Held, Sophie Spirkl
We consider the problem of constructing fast and small parallel prefix adders for non-uniform input arrival times. This problem arises whenever the adder is embedded into a more co…