Luis A. Goddyn

Publication Activity (10 Years)

Years Active: 1989-2019
Publications (10 Years): 5

Top Topics

Computational Effort

Lower And Upper Bounds

Top Venues

Discret. Comput. Geom.

Electron. J. Comb.

Publications

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