Luis Goddyn

707 total citations
30 papers, 372 citations indexed

About

Luis Goddyn is a scholar working on Computational Theory and Mathematics, Discrete Mathematics and Combinatorics and Electrical and Electronic Engineering. According to data from OpenAlex, Luis Goddyn has authored 30 papers receiving a total of 372 indexed citations (citations by other indexed papers that have themselves been cited), including 23 papers in Computational Theory and Mathematics, 12 papers in Discrete Mathematics and Combinatorics and 12 papers in Electrical and Electronic Engineering. Recurrent topics in Luis Goddyn's work include Advanced Graph Theory Research (18 papers), graph theory and CDMA systems (12 papers) and Limits and Structures in Graph Theory (10 papers). Luis Goddyn is often cited by papers focused on Advanced Graph Theory Research (18 papers), graph theory and CDMA systems (12 papers) and Limits and Structures in Graph Theory (10 papers). Luis Goddyn collaborates with scholars based in Canada, United States and Iran. Luis Goddyn's co-authors include Michael Tarsi, Matt DeVos, Bojan Mohar, M. N. Ellingham, Brian Alspach, Cun‐Quan Zhang, Robert Šámal, Wojciech Bienia, Jozef Širáň and R. Bruce Richter and has published in prestigious journals such as Transactions of the American Mathematical Society, Advances in Mathematics and Discrete Mathematics.

In The Last Decade

Luis Goddyn

29 papers receiving 344 citations

Peers — A (Enhanced Table)

Peers by citation overlap · career bar shows stage (early→late) cites · hero ref

Name	h						Papers	Cites
Luis Goddyn Canada	11	286	171	113	62	42	30	372
Tomáš Kaiser Czechia	12	348 1.2×	194 1.1×	73 0.6×	109 1.8×	59 1.4×	60	404
Charles Payan France	10	402 1.4×	116 0.7×	88 0.8×	108 1.7×	118 2.8×	27	481
Jochen Harant Germany	13	408 1.4×	151 0.9×	75 0.7×	112 1.8×	68 1.6×	62	448
Saul Stahl United States	10	218 0.8×	164 1.0×	64 0.6×	102 1.6×	23 0.5×	22	342
Glenn Hurlbert United States	11	233 0.8×	161 0.9×	87 0.8×	98 1.6×	15 0.4×	45	322
Y. Roditty Israel	10	446 1.6×	203 1.2×	115 1.0×	84 1.4×	59 1.4×	45	528
V. E. Alekseev Russia	9	242 0.8×	97 0.6×	52 0.5×	54 0.9×	78 1.9×	24	297
Paul Wollan Italy	13	445 1.6×	220 1.3×	49 0.4×	89 1.4×	101 2.4×	34	484
Kristina Vušković United Kingdom	15	577 2.0×	246 1.4×	98 0.9×	91 1.5×	96 2.3×	48	632
Iztok Peterin Slovenia	11	359 1.3×	123 0.7×	66 0.6×	134 2.2×	63 1.5×	71	408

Countries citing papers authored by Luis Goddyn

Since Specialization

Citations

This map shows the geographic impact of Luis Goddyn's research. It shows the number of citations coming from papers published by authors working in each country. You can also color the map by specialization and compare the number of citations received by Luis Goddyn with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Luis Goddyn more than expected).

Fields of papers citing papers by Luis Goddyn

Since Specialization

Physical SciencesHealth SciencesLife SciencesSocial Sciences

This network shows the impact of papers produced by Luis Goddyn. Nodes represent research fields, and links connect fields that are likely to share authors. Colored nodes show fields that tend to cite the papers produced by Luis Goddyn. The network helps show where Luis Goddyn may publish in the future.

Co-authorship network of co-authors of Luis Goddyn

This figure shows the co-authorship network connecting the top 25 collaborators of Luis Goddyn. A scholar is included among the top collaborators of Luis Goddyn based on the total number of citations received by their joint publications. Widths of edges represent the number of papers authors have co-authored together. Node borders signify the number of papers an author published with Luis Goddyn. Luis Goddyn is excluded from the visualization to improve readability, since they are connected to all nodes in the network.

All Works

Sort: Min cites: Since: Top N: Style:

20 of 20 papers shown

Goddyn, Luis, et al.. (2019). The Chromatic Number of Finite Group Cayley Tables. The Electronic Journal of Combinatorics. 26(1). 1 indexed citations

Goddyn, Luis, et al.. (2017). On the Bounds of Conway’s Thrackles. Discrete & Computational Geometry. 58(2). 410–416. 3 indexed citations

Goddyn, Luis, et al.. (2016). On the chromatic number of Latin square graphs. Discrete Mathematics. 339(11). 2613–2619. 6 indexed citations

Goddyn, Luis, et al.. (2016). Bicircular matroids are 3-colorable. Discrete Mathematics. 339(5). 1425–1429. 1 indexed citations

Goddyn, Luis, et al.. (2015). On Hilbert bases of cuts. Discrete Mathematics. 339(2). 721–728.

DeVos, Matt, Luis Goddyn, Bojan Mohar, & Robert Šámal. (2008). Cayley sum graphs and eigenvalues of(3,6)-fullerenes. Journal of Combinatorial Theory Series B. 99(2). 358–369. 29 indexed citations

DeVos, Matt, Luis Goddyn, & Bojan Mohar. (2008). A generalization of Kneser's Addition Theorem. Advances in Mathematics. 220(5). 1531–1548. 19 indexed citations

Goddyn, Luis, R. Bruce Richter, & Jozef Širáň. (2007). Triangular embeddings of complete graphs from graceful labellings of paths. Journal of Combinatorial Theory Series B. 97(6). 964–970. 21 indexed citations

Chudnovsky, Maria, et al.. (2006). Packing Non-Zero A-Paths In Group-Labelled Graphs. COMBINATORICA. 26(5). 521–532. 36 indexed citations

10.

Goddyn, Luis, Petr Hliněný, & Winfried Hochstättler. (2006). Balanced Signings and the Chromatic Number of Oriented Matroids. Combinatorics Probability Computing. 15(4). 523–539. 4 indexed citations

11.

Goddyn, Luis & Ladislav Stacho. (2005). Edge disjoint cycles through specified vertices. Journal of Graph Theory. 50(3). 246–260. 1 indexed citations

12.

DeVos, Matt, Luis Goddyn, Bojan Mohar, Dirk Vertigan, & Xuding Zhu. (2004). Coloring-flow duality of embedded graphs. Transactions of the American Mathematical Society. 357(10). 3993–4016. 13 indexed citations

13.

Galluccio, Anna & Luis Goddyn. (2002). The Circular Flow Number of a 6-Edge Connected Graph is Less Than Four. COMBINATORICA. 22(3). 455–459. 6 indexed citations

14.

Galluccio, Anna, Luis Goddyn, & Pavol Hell. (2001). High-Girth Graphs Avoiding a Minor are Nearly Bipartite. Journal of Combinatorial Theory Series B. 83(1). 1–14. 1 indexed citations

15.

Goddyn, Luis, et al.. (1999). Matroids with the Circuit Cover Property. European Journal of Combinatorics. 20(1). 61–73. 4 indexed citations

16.

Bienia, Wojciech, et al.. (1998). Flows, View Obstructions, and the Lonely Runner. Journal of Combinatorial Theory Series B. 72(1). 1–9. 35 indexed citations

17.

Goddyn, Luis, Jan van den Heuvel, & Sean McGuinness. (1997). Removable Circuits in Multigraphs. Journal of Combinatorial Theory Series B. 71(2). 130–143. 18 indexed citations

18.

Alspach, Brian, et al.. (1994). Graphs with the circuit cover property. Transactions of the American Mathematical Society. 344(1). 131–154. 41 indexed citations

19.

Alspach, Brian, Luis Goddyn, & Cun‐Quan Zhang. (1994). Graphs with the Circuit Cover Property. Transactions of the American Mathematical Society. 344(1). 131–131. 2 indexed citations

20.

Goddyn, Luis. (1990). Quantizers and the worst-case Euclidean traveling salesman problem. Journal of Combinatorial Theory Series B. 50(1). 65–81. 10 indexed citations

Rankless uses publication and citation data sourced from OpenAlex, an open and comprehensive bibliographic database. While OpenAlex provides broad and valuable coverage of the global research landscape, it—like all bibliographic datasets—has inherent limitations. These include incomplete records, variations in author disambiguation, differences in journal indexing, and delays in data updates. As a result, some metrics and network relationships displayed in Rankless may not fully capture the entirety of a scholar's output or impact.

Explore authors with similar magnitude of impact