| 2009 |
|---|
| 12 | EE | Matt DeVos,
Luis A. Goddyn,
Bojan Mohar,
Robert Sámal:
Cayley sum graphs and eigenvalues of (3, 6)-fullerenes.
J. Comb. Theory, Ser. B 99(2): 358-369 (2009) |
| 2008 |
|---|
| 11 | EE | Sergio Cabello,
Matt DeVos,
Jeff Erickson,
Bojan Mohar:
Finding one tight cycle.
SODA 2008: 527-531 |
| 10 | EE | Matt DeVos,
Vahan V. Mkrtchyan,
Samvel S. Petrosyan:
5-cycles and the Petersen graph
CoRR abs/0801.3714: (2008) |
| 9 | EE | Matt DeVos,
Bojan Mohar,
Robert Sámal:
Unexpected behaviour of crossing sequences.
Electronic Notes in Discrete Mathematics 31: 259-264 (2008) |
| 8 | EE | Matt DeVos,
Ken-ichi Kawarabayashi,
Bojan Mohar:
Locally planar graphs are 5-choosable.
J. Comb. Theory, Ser. B 98(6): 1215-1232 (2008) |
| 2007 |
|---|
| 7 | EE | Matt DeVos,
Javad Ebrahimi,
Mohammad Ghebleh,
Luis A. Goddyn,
Bojan Mohar,
Reza Naserasr:
Circular Coloring the Plane.
SIAM J. Discrete Math. 21(2): 461-465 (2007) |
| 2006 |
|---|
| 6 | EE | Matt DeVos,
Rui Xu,
Gexin Yu:
Nowhere-zero Z3-flows through Z3-connectivity.
Discrete Mathematics 306(1): 26-30 (2006) |
| 5 | EE | Matt DeVos,
Bojan Mohar:
Small separations in vertex-transitive graphs.
Electronic Notes in Discrete Mathematics 24: 165-172 (2006) |
| 2004 |
|---|
| 4 | EE | Matt DeVos,
Jaroslav Nesetril,
André Raspaud:
Antisymmetric flows and edge-connectivity.
Discrete Mathematics 276(1-3): 161-167 (2004) |
| 3 | EE | Matt DeVos,
Guoli Ding,
Bogdan Oporowski,
Daniel P. Sanders,
Bruce A. Reed,
Paul D. Seymour,
Dirk Vertigan:
Excluding any graph as a minor allows a low tree-width 2-coloring.
J. Comb. Theory, Ser. B 91(1): 25-41 (2004) |
| 2003 |
|---|
| 2 | EE | Matt DeVos,
Paul D. Seymour:
Extending partial 3-colourings in a planar graph.
J. Comb. Theory, Ser. B 88(2): 219-225 (2003) |
| 2000 |
|---|
| 1 | EE | Matt DeVos:
Matrix Choosability.
J. Comb. Theory, Ser. A 90(1): 197-209 (2000) |
