Luis A. Goddyn

25 papers B 1Journal 23Unranked 1
YearRankTypeTitle / Venue / Authors
2019 J jnl
The Chromatic Number of Finite Group Cayley Tables.
Electron. J. Comb.
Luis A. Goddyn, Kevin Halasz, Ebadollah S. Mahmoodian
2017 J jnl
On the Bounds of Conway's Thrackles.
Discret. Comput. Geom.
Luis A. Goddyn, Yian Xu
2016 J jnl
Bicircular matroids are 3-colorable.
Discret. Math.
Luis A. Goddyn, Winfried Hochstättler, Nancy Ann Neudauer
2016 J jnl
On Hilbert bases of cuts.
Discret. Math.
Luis A. Goddyn, Tony Huynh, Tanmay Deshpande
2016 J jnl
On the chromatic number of Latin square graphs.
Discret. Math.
Nazli Besharati, Luis A. Goddyn, Ebadollah S. Mahmoodian, M. Mortezaeefar
2011 J jnl
Balancing Covectors.
SIAM J. Discret. Math.
Laura Chávez-Lomelí, Luis A. Goddyn, Winfried Hochstättler
2009 J jnl
Cayley sum graphs and eigenvalues of (3, 6)-fullerenes.
J. Comb. Theory B
Matt DeVos, Luis A. Goddyn, Bojan Mohar, Robert Sámal
2008 J jnl
Silver Cubes.
Graphs Comb.
Mohammad Ghebleh, Luis A. Goddyn, Ebadollah S. Mahmoodian, Maryam Verdian-Rizi
2007 J jnl
Circular Coloring the Plane.
SIAM J. Discret. Math.
Matt DeVos, Javad B. Ebrahimi, Mohammad Ghebleh, Luis A. Goddyn, Bojan Mohar, Reza Naserasr
2007 J jnl
Triangular embeddings of complete graphs from graceful labellings of paths.
J. Comb. Theory B
Luis A. Goddyn, R. Bruce Richter, Jozef Sirán
2006 J jnl
Balanced Signings and the Chromatic Number of Oriented Matroids.
Comb. Probab. Comput.
Luis A. Goddyn, Petr Hlinený, Winfried Hochstättler
2006 J jnl
Packing Non-Zero A-Paths In Group-Labelled Graphs.
Comb.
Maria Chudnovsky, Jim Geelen, Bert Gerards, Luis A. Goddyn, Michael Lohman, Paul D. Seymour
2005 B conf
An Optimization Problem Related to VoD Broadcasting.
ISAAC
Tsunehiko Kameda, Yi Sun, Luis A. Goddyn
2005 J jnl
Edge disjoint cycles through specified vertices.
J. Graph Theory
Luis A. Goddyn, Ladislav Stacho
2003 J jnl
Binary Gray Codes with Long Bit Runs.
Electron. J. Comb.
Luis A. Goddyn, Pavol Gvozdjak
2002 J jnl
The Circular Flow Number of a 6-Edge Connected Graph is Less Than Four.
Comb.
Anna Galluccio, Luis A. Goddyn
2001 J jnl
High-Girth Graphs Avoiding a Minor are Nearly Bipartite.
J. Comb. Theory B
Anna Galluccio, Luis A. Goddyn, Pavol Hell
1999 J jnl
Matroids with the Circuit Cover Property.
Eur. J. Comb.
Xudong Fu, Luis A. Goddyn
1998 J jnl
Flows, View Obstructions, and the Lonely Runner.
J. Comb. Theory B
Wojciech Bienia, Luis A. Goddyn, Pavol Gvozdjak, András Sebö, Michael Tarsi
1998 J jnl
On (
J. Graph Theory
Luis A. Goddyn, Michael Tarsi, Cun-Quan Zhang
1997 J jnl
Removable Circuits in Multigraphs.
J. Comb. Theory B
Luis A. Goddyn, Jan van den Heuvel, Sean McGuinness
1996 J jnl
List Edge Colourings of Some 1-Factorable Multigraphs.
Comb.
Mark N. Ellingham, Luis A. Goddyn
1991 — conf
Cones, lattices and Hilbert bases of circuits and perfect matchings.
Graph Structure Theory
Luis A. Goddyn
1990 J jnl
Quantizers and the worst-case Euclidean traveling salesman problem.
J. Comb. Theory B
Luis A. Goddyn
1989 J jnl
Cycle double covers of graphs with Hamilton paths.
J. Comb. Theory B
Luis A. Goddyn