19 citations · 43 across the 33 of their papers we have counts for
6 papers · 1 filter
Finding non-bisimplicial and triad-free minimal separators
Maria Chudnovsky, Ilya Maier
A separator in is a set such that there is no path in . A minimal separator in is a set such t…
Forbidden Subgraphs of Graphs with Low Bandwidth
Maria Chudnovsky, Daniel Lokshtanov, Eran Nevo
A layout of a graph G is an injective function , and the bandwidth of a layout f is . The bandwidth bw(G) of G is…
On the chromatic number of the union of comparability graphs
Wouter Cames van Batenburg, Maria Chudnovsky, Linda Cook +3
Resolving in a strong sense a problem of Gyárfás on the union of two perfect graphs, we prove that for every pair of positive integers and , there is a graph with clique…
Tree-independence number and forbidden induced subgraphs: excluding a -vertex path and a -biclique
Maria Chudnovsky, Julien Codsi, J. Pascal Gollin +2
We show that for every positive integer there exists an integer such that every graph that contains no induced subgraph isomorphic to either the -vertex path or…
Minors of plane digraphs
Maria Chudnovsky, Paul Seymour
A digraph is a ``semi-strong minor'' of another, , if a subdivision of can be obtained from a subdigraph of by contracting strongly-connected subdigraphs to single v…
Induced Cycles of Many Lengths
Maria Chudnovsky, Ilya Maier
Let be a graph and let be the number of distinct induced cycle lengths in . We show that for , every graph that does not contain an in…