Luis A. Goddyn - researchr alias

researchr

You are not signed in
Sign in
Sign up

Viewing Publication 1 - 25 from 25

2019

The Chromatic Number of Finite Group Cayley TablesLuis A. Goddyn, Kevin Halasz, Ebadollah S. Mahmoodian. combinatorics, 26(1):1, 2019. [doi]

2017

On the Bounds of Conway's ThracklesLuis A. Goddyn, Yian Xu. dcg, 58(2):410-416, 2017. [doi]

2016

On the chromatic number of Latin square graphsNazli Besharati, Luis A. Goddyn, Ebadollah S. Mahmoodian, M. Mortezaeefar. DM, 339(11):2613-2619, 2016. [doi]

Bicircular matroids are 3-colorableLuis A. Goddyn, Winfried Hochstättler, Nancy Ann Neudauer. DM, 339(5):1425-1429, 2016. [doi]

On Hilbert bases of cutsLuis A. Goddyn, Tony Huynh, Tanmay Deshpande. DM, 339(2):721-728, 2016. [doi]

2011

Balancing CovectorsLaura Chávez-Lomelí, Luis A. Goddyn, Winfried Hochstättler. siamdm, 25(3):1315-1318, 2011. [doi]

2009

Cayley sum graphs and eigenvalues of (3, 6)-fullerenesMatt DeVos, Luis A. Goddyn, Bojan Mohar, Robert Sámal. JCT, 99(2):358-369, 2009. [doi]

2008

Silver CubesMohammad Ghebleh, Luis A. Goddyn, Ebadollah S. Mahmoodian, Maryam Verdian-Rizi. gc, 24(5):429-442, 2008. [doi]

2007

Circular Coloring the PlaneMatt DeVos, Javad Ebrahimi, Mohammad Ghebleh, Luis A. Goddyn, Bojan Mohar, Reza Naserasr. siamdm, 21(2):461-465, 2007. [doi]

Triangular embeddings of complete graphs from graceful labellings of pathsLuis A. Goddyn, R. Bruce Richter, Jozef Sirán. JCT, 97(6):964-970, 2007. [doi]

2006

Packing Non-Zero A-Paths In Group-Labelled GraphsMaria Chudnovsky, Jim Geelen, Bert Gerards, Luis A. Goddyn, Michael Lohman, Paul D. Seymour. combinatorica, 26(5):521-532, 2006. [doi]

Balanced Signings and the Chromatic Number of Oriented MatroidsLuis A. Goddyn, Petr Hlinený, Winfried Hochstättler. cpc, 15(4):523-539, 2006. [doi]

2005

Edge disjoint cycles through specified verticesLuis A. Goddyn, Ladislav Stacho. jgt, 50(3):246-260, 2005. [doi]

An Optimization Problem Related to VoD BroadcastingTsunehiko Kameda, Yi Sun, Luis A. Goddyn. isaac 2005: 116-125 [doi]

2003

Binary Gray Codes with Long Bit RunsLuis A. Goddyn, Pavol Gvozdjak. combinatorics, 10, 2003. [doi]

2002

The Circular Flow Number of a 6-Edge Connected Graph is Less Than FourAnna Galluccio, Luis A. Goddyn. combinatorica, 22(3):455-459, 2002. [doi]

2001

High-Girth Graphs Avoiding a Minor are Nearly BipartiteAnna Galluccio, Luis A. Goddyn, Pavol Hell. JCT, 83(1):1-14, 2001. [doi]

1999

Matroids with the Circuit Cover PropertyXudong Fu, Luis A. Goddyn. ejc, 20(1):61-73, 1999. [doi]

1998

Flows, View Obstructions, and the Lonely RunnerWojciech Bienia, Luis A. Goddyn, Pavol Gvozdjak, András Sebö, Michael Tarsi. JCT, 72(1):1-9, 1998. [doi]

d)-colorings and fractional nowhere-zero flowsLuis A. Goddyn, Michael Tarsi, Cun-Quan Zhang. jgt, 28(3):155-161, 1998. [doi]

1997

Removable Circuits in MultigraphsLuis A. Goddyn, Jan van den Heuvel, Sean McGuinness. JCT, 71(2):130-143, 1997. [doi]

1996

List Edge Colourings of Some 1-Factorable MultigraphsMark N. Ellingham, Luis A. Goddyn. combinatorica, 16(3):343-352, 1996.

1991

Cones, lattices and Hilbert bases of circuits and perfect matchingsLuis A. Goddyn. gst 1993: 419-440

1990

Quantizers and the worst-case Euclidean traveling salesman problemLuis A. Goddyn. JCT, 50(1):65-81, 1990. [doi]

1989

Cycle double covers of graphs with Hamilton pathsLuis A. Goddyn. JCT, 46(2):253-254, 1989. [doi]

Sign in or sign up to see more results.

runs on WebDSL