default search action
Luis A. Goddyn
Person information
- affiliation: Simon Fraser University, Canada
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2019
- [j23]Luis A. Goddyn, Kevin Halasz, Ebadollah S. Mahmoodian:
The Chromatic Number of Finite Group Cayley Tables. Electron. J. Comb. 26(1): 1 (2019) - 2017
- [j22]Luis A. Goddyn, Yian Xu:
On the Bounds of Conway's Thrackles. Discret. Comput. Geom. 58(2): 410-416 (2017) - 2016
- [j21]Luis A. Goddyn, Tony Huynh, Tanmay Deshpande:
On Hilbert bases of cuts. Discret. Math. 339(2): 721-728 (2016) - [j20]Luis A. Goddyn, Winfried Hochstättler, Nancy Ann Neudauer:
Bicircular matroids are 3-colorable. Discret. Math. 339(5): 1425-1429 (2016) - [j19]Nazli Besharati, Luis A. Goddyn, Ebadollah S. Mahmoodian, M. Mortezaeefar:
On the chromatic number of Latin square graphs. Discret. Math. 339(11): 2613-2619 (2016) - 2011
- [j18]Laura Chávez-Lomelí, Luis A. Goddyn, Winfried Hochstättler:
Balancing Covectors. SIAM J. Discret. Math. 25(3): 1315-1318 (2011)
2000 – 2009
- 2009
- [j17]Matt DeVos, Luis A. Goddyn, Bojan Mohar, Robert Sámal:
Cayley sum graphs and eigenvalues of (3, 6)-fullerenes. J. Comb. Theory B 99(2): 358-369 (2009) - 2008
- [j16]Mohammad Ghebleh, Luis A. Goddyn, Ebadollah S. Mahmoodian, Maryam Verdian-Rizi:
Silver Cubes. Graphs Comb. 24(5): 429-442 (2008) - 2007
- [j15]Luis A. Goddyn, R. Bruce Richter, Jozef Sirán:
Triangular embeddings of complete graphs from graceful labellings of paths. J. Comb. Theory B 97(6): 964-970 (2007) - [j14]Matt DeVos, Javad B. Ebrahimi, Mohammad Ghebleh, Luis A. Goddyn, Bojan Mohar, Reza Naserasr:
Circular Coloring the Plane. SIAM J. Discret. Math. 21(2): 461-465 (2007) - 2006
- [j13]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): 521-532 (2006) - [j12]Luis A. Goddyn, Petr Hlinený, Winfried Hochstättler:
Balanced Signings and the Chromatic Number of Oriented Matroids. Comb. Probab. Comput. 15(4): 523-539 (2006) - 2005
- [j11]Luis A. Goddyn, Ladislav Stacho:
Edge disjoint cycles through specified vertices. J. Graph Theory 50(3): 246-260 (2005) - [c2]Tsunehiko Kameda, Yi Sun, Luis A. Goddyn:
An Optimization Problem Related to VoD Broadcasting. ISAAC 2005: 116-125 - 2003
- [j10]Luis A. Goddyn, Pavol Gvozdjak:
Binary Gray Codes with Long Bit Runs. Electron. J. Comb. 10 (2003) - 2002
- [j9]Anna Galluccio, Luis A. Goddyn:
The Circular Flow Number of a 6-Edge Connected Graph is Less Than Four. Comb. 22(3): 455-459 (2002) - 2001
- [j8]Anna Galluccio, Luis A. Goddyn, Pavol Hell:
High-Girth Graphs Avoiding a Minor are Nearly Bipartite. J. Comb. Theory B 83(1): 1-14 (2001)
1990 – 1999
- 1999
- [j7]Xudong Fu, Luis A. Goddyn:
Matroids with the Circuit Cover Property. Eur. J. Comb. 20(1): 61-73 (1999) - 1998
- [j6]Wojciech Bienia, Luis A. Goddyn, Pavol Gvozdjak, András Sebö, Michael Tarsi:
Flows, View Obstructions, and the Lonely Runner. J. Comb. Theory B 72(1): 1-9 (1998) - [j5]Luis A. Goddyn, Michael Tarsi, Cun-Quan Zhang:
On (k, d)-colorings and fractional nowhere-zero flows. J. Graph Theory 28(3): 155-161 (1998) - 1997
- [j4]Luis A. Goddyn, Jan van den Heuvel, Sean McGuinness:
Removable Circuits in Multigraphs. J. Comb. Theory B 71(2): 130-143 (1997) - 1996
- [j3]Mark N. Ellingham, Luis A. Goddyn:
List Edge Colourings of Some 1-Factorable Multigraphs. Comb. 16(3): 343-352 (1996) - 1991
- [c1]Luis A. Goddyn:
Cones, lattices and Hilbert bases of circuits and perfect matchings. Graph Structure Theory 1991: 419-439 - 1990
- [j2]Luis A. Goddyn:
Quantizers and the worst-case Euclidean traveling salesman problem. J. Comb. Theory B 50(1): 65-81 (1990)
1980 – 1989
- 1989
- [j1]Luis A. Goddyn:
Cycle double covers of graphs with Hamilton paths. J. Comb. Theory B 46(2): 253-254 (1989)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from , , and to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-09-05 23:39 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint