| Publication | Date of Publication | Type |
|---|
Strongly even-cycle decomposable graphs
Journal of Graph Theory | 2017-02-01 | Paper |
Fast clique minor generation in Chimera qubit connectivity graphs
Quantum Information Processing | 2016-04-04 | Paper |
A short proof that \(\chi\) can be bounded \(\epsilon\) away from \(\Delta + 1\) toward \(\omega\)
Journal of Graph Theory | 2016-02-01 | Paper |
Constructing SAT filters with a quantum annealer
Lecture Notes in Computer Science | 2015-11-20 | Paper |
Claw-free graphs, skeletal graphs, and a stronger conjecture on \(\omega\), \(\Delta\), and \(\chi\)
Journal of Graph Theory | 2015-03-24 | Paper |
A superlocal version of Reed's conjecture
The Electronic Journal of Combinatorics | 2015-01-22 | Paper |
A superlocal version of Reed's conjecture
The Electronic Journal of Combinatorics | 2015-01-22 | Paper |
(Circular) backbone colouring: forest backbones in planar graphs
Discrete Applied Mathematics | 2014-05-06 | Paper |
| List circular backbone colouring | 2014-05-02 | Paper |
Finding a smallest odd hole in a claw-free graph using global structure
Discrete Applied Mathematics | 2014-04-10 | Paper |
Bounding the fractional chromatic number of \(K_\Delta\)-free graphs
SIAM Journal on Discrete Mathematics | 2013-09-26 | Paper |
A note on hitting maximum and maximal cliques with a stable set
Journal of Graph Theory | 2013-07-31 | Paper |
Asymptotics of the chromatic number for quasi-line graphs
Journal of Graph Theory | 2013-07-31 | Paper |
A Local Strengthening of Reed's $\omega$, $\Delta$, $\chi$ Conjecture for Quasi-line Graphs
SIAM Journal on Discrete Mathematics | 2013-06-27 | Paper |
A fractional analogue of Brooks' theorem
SIAM Journal on Discrete Mathematics | 2012-09-12 | Paper |
Fractional total colourings of graphs of high girth
Journal of Combinatorial Theory. Series B | 2011-12-08 | Paper |
| Optimal antithickenings of claw-free trigraphs | 2011-10-23 | Paper |
Hitting all maximum cliques with a stable set using lopsided independent transversals
Journal of Graph Theory | 2011-08-16 | Paper |
Exponentially many perfect matchings in cubic graphs
Advances in Mathematics | 2011-07-25 | Paper |
Covering line graphs with equivalence relations
Discrete Applied Mathematics | 2010-11-25 | Paper |
| A stronger result on fractional strong colourings | 2010-09-30 | Paper |
| An upper bound for the chromatic number of line graphs | 2010-07-30 | Paper |
Finding a maximum-weight induced \(k\)-partite subgraph of an \(i\)-triangulated graph
Discrete Applied Mathematics | 2010-05-25 | Paper |
The firefighter problem for cubic graphs
Discrete Mathematics | 2010-03-29 | Paper |
Bounding χ in terms of ω and Δ for quasi-line graphs
Journal of Graph Theory | 2009-02-20 | Paper |
Asymptotics of the chromatic number for quasi-line graphs
Electronic Notes in Discrete Mathematics | 2008-06-05 | Paper |
An upper bound for the chromatic number of line graphs
European Journal of Combinatorics | 2007-11-21 | Paper |
The firefighter problem for graphs of maximum degree three
Discrete Mathematics | 2007-06-26 | Paper |
Generating indecomposable permutations
Discrete Mathematics | 2006-04-28 | Paper |
