 | 2010 |
| 11 |  | Louis Esperet,
John Gimbel,
Andrew D. King:
Covering line graphs with equivalence relations.
Discrete Applied Mathematics 158(17): 1902-1907 (2010) |
| 10 |  | John Gimbel,
Jaroslav Nesetril:
Partitions of graphs into cographs.
Discrete Mathematics 310(24): 3437-3445 (2010) |
| 2009 |
| 9 |  | Tinaz Ekim,
John Gimbel:
Partitioning graphs into complete and empty graphs.
Discrete Mathematics 309(19): 5849-5856 (2009) |
| 2003 |
| 8 |  | John Gimbel:
Some Remarks on the Convexity Number of a Graph.
Graphs and Combinatorics 19(3): 357-361 (2003) |
| 2002 |
| 7 |  | John Gimbel,
Jaroslav Nesetril:
Partitions of Graphs into Cographs.
Electronic Notes in Discrete Mathematics 11: 705-721 (2002) |
| 2000 |
| 6 |  | John Gimbel,
Carsten Thomassen:
Coloring triangle-free graphs with fixed size.
Discrete Mathematics 219(1-3): 275-277 (2000) |
| 1997 |
| 5 |  | John Gimbel,
Maryvonne Mahéo,
Christine Virlouvet:
Double total domination of graphs.
Discrete Mathematics 165-166: 343-351 (1997) |
| 1991 |
| 4 |  | John Gimbel,
Edgar M. Palmer:
Matchings and cycle covers in random digraphs.
Discrete Applied Mathematics 34(1-3): 121-128 (1991) |
| 1988 |
| 3 |  | John Gimbel:
End vertices in interval graphs.
Discrete Applied Mathematics 21(3): 257-259 (1988) |
| 1987 |
| 2 |  | John Gimbel,
H. Joseph Straight:
Some topics in cochromatic theory.
Graphs and Combinatorics 3(1): 255-265 (1987) |
| 1985 |
| 1 |  | Dale Skrien,
John Gimbel:
Homogeneously representable interval graphs.
Discrete Mathematics 55(2): 213-216 (1985) |