| Year |
Citation |
Score |
| 2016 |
Besharati N, Goddyn L, Mahmoodian ES, Mortezaeefar M. On the chromatic number of Latin square graphs Discrete Mathematics. 339: 2613-2619. DOI: 10.1016/J.Disc.2016.04.025 |
0.502 |
|
| 2016 |
Goddyn L, Hochstättler W, Neudauer NA. Bicircular matroids are 3-colorable Discrete Mathematics. 339: 1425-1429. DOI: 10.1016/J.Disc.2015.12.015 |
0.475 |
|
| 2016 |
Goddyn L, Huynh T, Deshpande T. On Hilbert bases of cuts Discrete Mathematics. 339: 721-728. DOI: 10.1016/J.Disc.2015.09.021 |
0.549 |
|
| 2009 |
DeVos M, Goddyn L, Mohar B, Šámal R. Cayley sum graphs and eigenvalues of (3, 6)-fullerenes Journal of Combinatorial Theory. Series B. 99: 358-369. DOI: 10.1016/J.Jctb.2008.08.005 |
0.495 |
|
| 2009 |
DeVos M, Goddyn L, Mohar B. A generalization of Kneser's Addition Theorem Advances in Mathematics. 220: 1531-1548. DOI: 10.1016/J.Aim.2008.11.003 |
0.415 |
|
| 2007 |
DeVos M, Goddyn L, Mohar B, Šámal R. A quadratic lower bound for subset sums Acta Arithmetica. 129: 187-195. DOI: 10.4064/Aa129-2-4 |
0.327 |
|
| 2007 |
Devos M, Ebrahimi J, Ghebleh M, Goddyn L, Mohar B, Naserasr R. Circular coloring the plane Siam Journal On Discrete Mathematics. 21: 461-465. DOI: 10.1137/060664276 |
0.474 |
|
| 2007 |
Chávez Lomelí LE, Goddyn LA. Eulerian and Bipartite Orientable Matroids Combinatorics, Complexity, and Chance: a Tribute to Dominic Welsh. DOI: 10.1093/acprof:oso/9780198571278.003.0002 |
0.517 |
|
| 2007 |
Goddyn L, Richter RB, Širáň J. Triangular embeddings of complete graphs from graceful labellings of paths Journal of Combinatorial Theory. Series B. 97: 964-970. DOI: 10.1016/J.Jctb.2007.02.009 |
0.489 |
|
| 2006 |
Goddyn L, Hliněný P, Hochstättler W. Balanced signings and the chromatic number of oriented matroids Combinatorics Probability and Computing. 15: 523-539. DOI: 10.1017/S096354830500742X |
0.367 |
|
| 2006 |
Chudnovsky M, Geelen J, Gerards B, Goddyn L, Lohman M, Seymour P. Packing non-zero A-paths in group-labelled graphs Combinatorica. 26: 521-532. DOI: 10.1007/S00493-006-0030-1 |
0.53 |
|
| 2005 |
Devos M, Goddyn L, Mohar B, Vertigan D, Zhu X. Coloring-flow duality of embedded graphs Transactions of the American Mathematical Society. 357: 3993-4016. DOI: 10.1090/S0002-9947-04-03544-5 |
0.482 |
|
| 2005 |
Goddyn L, Stacho L. Edge disjoint cycles through specified vertices Journal of Graph Theory. 50: 246-260. DOI: 10.1002/Jgt.V50:3 |
0.501 |
|
| 2002 |
Galluccio A, Goddyn LA. The circular flow number of a 6-edge connected graph is less than four Combinatorica. 22: 455-459. DOI: 10.1007/s004930200025 |
0.436 |
|
| 2001 |
Galluccio A, Goddyn LA, Hell P. High-girth graphs avoiding a minor are nearly bipartite Journal of Combinatorial Theory. Series B. 83: 1-14. DOI: 10.1006/Jctb.2000.2009 |
0.523 |
|
| 1998 |
Bienia W, Goddyn L, Gvozdjak P, Sebo A, Tarsi M. Flows, view obstructions, and the lonely runner Journal of Combinatorial Theory. Series B. 72: 1-9. DOI: 10.1006/Jctb.1997.1770 |
0.424 |
|
| 1997 |
Goddyn LA, Van Den Heuvel J, McGuinness S. Removable circuits in multigraphs Journal of Combinatorial Theory. Series B. 71: 130-143. DOI: 10.1006/jctb.1997.1775 |
0.439 |
|
| 1996 |
Ellingham MN, Goddyn L. List Edge Colourings of some 1-factorable multigraphs Combinatorica. 16: 343-352. DOI: 10.1007/Bf01261320 |
0.462 |
|
| 1994 |
Lspach B, Goddyn L, Hang CQ. Graphs with the circuit cover property Transactions of the American Mathematical Society. 344: 131-154. DOI: 10.1090/S0002-9947-1994-1181180-1 |
0.52 |
|
| 1989 |
Goddyn LA. Cycle double covers of graphs with Hamilton paths Journal of Combinatorial Theory, Series B. 46: 253-254. DOI: 10.1016/0095-8956(89)90048-8 |
0.515 |
|
| 1985 |
Goddyn L. A Counterexample to a Conjecture about Oriented Graphs North-Holland Mathematics Studies. 115: 235-236. DOI: 10.1016/S0304-0208(08)73017-2 |
0.529 |
|
| 1985 |
Goddyn L. A Girth Requirement for the Double Cycle Cover Conjecture North-Holland Mathematics Studies. 115: 13-26. DOI: 10.1016/S0304-0208(08)72994-3 |
0.364 |
|
| Show low-probability matches. |