2 citations · 2 across the 8 of their papers we have counts for
9 papers · 1 filter
Excluding paths and bicliques
Maria Chudnovsky, Julien Codsi, Matjaž Krnc +1
Classes of graphs excluding a path and a biclique as induced subgraphs are extensively studied in the literature. One of the key structural results for such graphs is a Ramsey-type…
Dominated balanced separators in wheel-induced-minor-free graphs
Maria Chudnovsky, J. Pascal Gollin, Matjaž Krnc +1
Gartland and Lokshtanov conjectured that every graph that excludes some planar graph as an induced minor has a balanced separator, that is, a separator whose deletion leaves every…
Row Impartial Terminus
Eric Gottlieb, Dawood Khatana, Matjaž Krnc +2
We introduce Row Impartial Terminus (RIT), an impartial combinatorial game played on integer partitions. We show that any position in RIT can be uniquely decomposed into a core and…
Linear colorings of graphs
Claire Hilaire, Matjaž Krnc, Martin Milanič +1
Motivated by algorithmic applications, Kun, O'Brien, Pilipczuk, and Sullivan introduced the parameter linear chromatic number as a relaxation of treedepth and proved that the two p…
Young domination on Hamming rectangles
Janko Gravner, Matjaž Krnc, Martin Milanič +1
We introduce a family of domination-type problems in Cartesian products of two graphs. The framework captures several well-studied topics, including variants of bootstrap percolati…
Ramsey multiplicity of apices of trees
Daniel Kráľ, Matjaž Krnc, Ander Lamaison
A graph is common if its Ramsey multiplicity, i.e., the minimum number of monochromatic copies of contained in any -edge-coloring of , is asymptotically the same as…