| Publication | Date of Publication | Type |
|---|
List-avoiding orientations
Combinatorica | 2025-01-14 | Paper |
Partitioning graphs with linear minimum degree
Random Structures & Algorithms | 2024-10-24 | Paper |
The inducibility of oriented stars
Journal of Combinatorial Theory. Series B | 2024-07-01 | Paper |
Graph partitions under average degree constraint
Journal of Combinatorial Theory. Series B | 2024-01-15 | Paper |
Partitioning graphs with linear minimum degree
| 2023-06-13 | Paper |
Proper orientations and proper chromatic number
Journal of Combinatorial Theory. Series B | 2023-05-02 | Paper |
Triangle-free subgraphs with large fractional chromatic number
Combinatorics, Probability and Computing | 2023-03-31 | Paper |
Subgraphs of Kneser graphs with large girth and large chromatic number
The Art of Discrete and Applied Mathematics | 2022-12-19 | Paper |
List-avoiding orientations
| 2022-09-19 | Paper |
On the Turán number of the linear \(3\)-graph \(C_{13}\)
The Electronic Journal of Combinatorics | 2022-09-06 | Paper |
Fractional chromatic number of a random subgraph
Journal of Graph Theory | 2022-03-31 | Paper |
1-subdivisions, the fractional chromatic number and the Hall ratio
Combinatorica | 2021-04-16 | Paper |
The Betti Number of the Independence Complex of Ternary Graphs
| 2020-11-22 | Paper |
A Ramsey Type problem for highly connected subgraphs
| 2020-08-20 | Paper |
The inducibility of oriented stars
| 2020-08-12 | Paper |
Coloring tournaments: from local to global
Journal of Combinatorial Theory. Series B | 2019-07-17 | Paper |
Weak duality for packing edge-disjoint odd \((u, v)\)-trails
Proceedings of the Twenty-Seventh Annual ACM-SIAM Symposium on Discrete Algorithms | 2018-07-16 | Paper |
Word-representability of split graphs
| 2017-09-27 | Paper |
Large Supports are required for Well-Supported Nash Equilibria
| 2017-08-31 | Paper |
The extremal function for disconnected minors
Journal of Combinatorial Theory. Series B | 2017-08-22 | Paper |
Dichromatic number and fractional chromatic number
Forum of Mathematics, Sigma | 2017-04-04 | Paper |
Triangle-free subgraphs with large fractional chromatic number
| 2016-10-14 | Paper |
Interval minors of complete bipartite graphs
Journal of Graph Theory | 2016-08-12 | Paper |
A proof of a conjecture of Ohba
Journal of Graph Theory | 2015-05-22 | Paper |
Beyond Ohba's conjecture: a bound on the choice number of \(k\)-chromatic graphs with \(n\) vertices
European Journal of Combinatorics | 2014-10-08 | Paper |
Decomposition of sparse graphs into forests and a graph with bounded degree
Journal of Graph Theory | 2013-11-15 | Paper |
Complete minors, independent sets, and chordal graphs
Discussiones Mathematicae. Graph Theory | 2012-09-05 | Paper |
Packing of Steiner trees and \(S\)-connectors in graphs
Journal of Combinatorial Theory. Series B | 2012-03-19 | Paper |
Regular matroids without disjoint circuits.
| 2012-02-20 | Paper |
Longest cycles in \(k\)-connected graphs with given independence number
Journal of Combinatorial Theory. Series B | 2011-12-08 | Paper |
Every 3-connected, essentially 11-connected line graph is Hamiltonian
| 2010-07-30 | Paper |
The hub number of a graph
Information Processing Letters | 2010-06-09 | Paper |
Optimal strong parity edge-coloring of complete graphs
Combinatorica | 2009-12-28 | Paper |
On mod \((2p+1)\)-orientations of graphs
Journal of Combinatorial Theory. Series B | 2009-03-04 | Paper |
scientific article; zbMATH DE number 5237271 (Why is no real title available?)
| 2008-02-20 | Paper |
Every 3-connected, essentially 11-connected line graph is Hamiltonian
Journal of Combinatorial Theory. Series B | 2006-07-12 | Paper |
