7 citations · 13 across the 8 of their papers we have counts for
8 papers
There are only a finite number of excluded minors for the class of bicircular matroids
Matt DeVos, Daryl Funk, Luis Goddyn +1
We show that the class of bicircular matroids has only a finite number of excluded minors. Key tools used in our proof include representations of matroids by biased graphs and the…
The Chromatic Number of Finite Group Cayley Tables
Luis Goddyn, Kevin Halasz, E. S. Mahmoodian
The chromatic number of a latin square , denoted , is the minimum number of partial transversals needed to cover all of its cells. It has been conjectured that every latin…
-restricted Double Traces
Dan Archdeacon, Luis Goddyn, Jernej Rus
For a graph and , an -restricted strong trace is a closed walk which traverses every edge from once in each direction and every other edge twice in the…
On the chromatic number of Latin square graphs
Nazli Besharati, Luis Goddyn, E. S. Mahmoodian +1
The chromatic number of a Latin square is the least number of partial transversals which cover its cells. This is just the chromatic number of its associated Latin square graph. Al…
On Hilbert bases of cuts
Luis Goddyn, Tony Huynh, Tanmay Deshpande
A Hilbert basis is a set of vectors X such that the integer cone (semigroup) generated by X is the intersection of the lattice generated by X with the cone generated by X. Define a…
Few Long Lists for Edge Choosability of Planar Cubic Graphs
Luis Goddyn, Andrea Spencer
It is known that every loopless cubic graph is 4-edge choosable. We prove the following strengthened result. Let G be a planar cubic graph having b cut-edges. There exists a set F…