![]() | ![]() |
2007 | ||
---|---|---|
12 | EE | Scott Jones, Sean McGuinness: Defining matroids through sequential selection. Eur. J. Comb. 28(1): 469-480 (2007) |
2005 | ||
11 | EE | Sean McGuinness: Bonds Intersecting Cycles In A Graph. Combinatorica 25(4): 439-450 (2005) |
10 | EE | Sean McGuinness: Circuits Through Cocircuits In A Graph With Extensions To Matroids. Combinatorica 25(4): 451-463 (2005) |
9 | EE | Sean McGuinness: Contractible bonds in graphs. J. Comb. Theory, Ser. B 93(2): 207-249 (2005) |
8 | EE | Roland Häggkvist, Sean McGuinness: Double covers of cubic graphs with oddness 4. J. Comb. Theory, Ser. B 93(2): 251-277 (2005) |
2001 | ||
7 | EE | Sean McGuinness: Colouring Arcwise Connected Sets in the Plane II. Graphs and Combinatorics 17(1): 135-148 (2001) |
2000 | ||
6 | EE | Sean McGuinness: Contractible bonds in Graphs. Electronic Notes in Discrete Mathematics 5: 225-227 (2000) |
1997 | ||
5 | EE | Luis A. Goddyn, Jan van den Heuvel, Sean McGuinness: Removable Circuits in Multigraphs. J. Comb. Theory, Ser. B 71(2): 130-143 (1997) |
1996 | ||
4 | EE | Sean McGuinness: On bounding the chromatic number of L-graphs. Discrete Mathematics 154(1-3): 179-187 (1996) |
1994 | ||
3 | Sean McGuinness: Restricted Greedy Clique Decompositions and Greedy Clique Decompositions of K4-Free Graphs. Combinatorica 14(3): 321-334 (1994) | |
2 | Sean McGuinness: Greedy Maximum-Clique Decompositions. Combinatorica 14(3): 335-343 (1994) | |
1990 | ||
1 | EE | Sean McGuinness, Rolf S. Rees: On the number of distinct minimal clique partitions and clique covers of a line graph. Discrete Mathematics 83(1): 49-62 (1990) |
1 | Luis A. Goddyn | [5] |
2 | Roland Häggkvist | [8] |
3 | Jan van den Heuvel | [5] |
4 | Scott Jones | [12] |
5 | Rolf S. Rees | [1] |