- chapter02 OUP012/McDiarmid (Typeset by SPi, Delhi) 11 of 27 July 4, 2006 13:12 EULERIAN AND BIPARTITE ORIENTABLE MATROIDS
- Triangular embeddings of complete graphs from graceful labellings of paths
- Edge Disjoint Cycles Through Specified Vertices Luis Goddyn #
- High Girth Graphs Avoiding a Minor are Nearly Bipartite Anna Galluccio \Lambda
- Luis Goddyn, October 6, 2000 A Theorem Arising from Conditional Probabilities
- Cayley sum graphs and eigenvalues of (3, 6)fullerenes Matt DeVos Luis Goddyn # Bojan Mohar +#
- Removable Circuits in Multigraphs Luis A. Goddyn 1 \Lambda
- Solution to Problem 10470 proposed by D. Knuth in the American Math. Monthly, 102 no. 7 (1995) p. 655
- Balancing Covectors Laura ChavezLomel
- Circular Chromatic Number of EvenFaced Projective Plane DRAFT 2: NOT FOR DISTRIBUTION
- The circular flow number of a 6edge connected graph is less than Anna Galluccio \Lambda
- Minty-type formulas Luis Goddyn *
- On (k; d )Colorings and Fractional Nowhere Zero Luis A. Goddyn \Lambda
- Removable Circuits in Binary Matroids Luis A Goddyn
- An Optimization Problem Related to Truncated Harmonic Broadcasting for Video-on-Demand
- PACKING NON-ZERO A-PATHS IN GROUP-LABELED MARIA CHUDNOVSKY 1 , JIM GEELEN 2 , BERT GERARDS 3 , LUIS
- List edge colourings of some 1factorable multigraphs M. N. Ellingham 1
- Cones, Lattices and Hilbert Bases of Circuits and Perfect Matchings
- Cayley sum graphs and eigenvalues of (3, 6)-fullerenes Matt DeVos Luis Goddyn
- TRANSACTIONS OF THE AMERICAN MATHEMATICAL SOCIETY
- Silver Cubes Mohammad Ghebleh1
- TRANSACTIONS OF THE AMERICAN MATHEMATICAL SOCIETY
- Edge Disjoint Cycles Through Specified Vertices Luis Goddyn
- Balanced Signings and the Chromatic Number of Oriented Luis Goddyn*
- TIGHT INSTANCES OF THE LONELY RUNNER Luis Goddyn1
- CIRCULAR COLOURING THE PLANE MATT DEVOS , JAVAD EBRAHIMI , MOHAMMAD GHEBLEH , LUIS GODDYN ,
- A quadratic lower bound for subset sums Matt DeVos Luis Goddyn
- Circular Chromatic Number of Even-Faced Projective Plane DRAFT 2: NOT FOR DISTRIBUTION
- Cayley sum graphs and eigenvalues of (3, 6)-fullerenes Matt DeVos Luis Goddyn* Bojan Moharyz
- TRANSACTIONS OF THE AMERICAN MATHEMATICAL SOCIETY
- On (k, d )-Colorings and Fractional Nowhere Zero Flows
- Flows, View-Obstructions and the Lonely Runner Wojciech Bienia 1
- Binary Gray Codes with Long Bit Runs Luis Goddyn*
- Balanced Signings and the Chromatic Number of Oriented Matroids
- Edge Disjoint Cycles Through Specified Vertices Luis Goddyn*
- Solution to Problem 10470 proposed by D. Knuth in the American Math. Monthly, 102 no. 7 (1995) p. 655
- Matroids with the Circuit Cover Property Xudong Fu Luis A. Goddyn*
- TIGHT INSTANCES OF THE LONELY RUNNER Luis Goddyn 1
- Flows, ViewObstructions and the Lonely Runner Wojciech Bienia 1
- Matroids with the Circuit Cover Property Department of Computer Science
- A generalization of Kneser's Addition Theorem Matt DeVos, Luis Goddyn
- TIGHT INSTANCES OF THE LONELY RUNNER Luis Goddyn1
- Minty-type formulas Luis Goddyn*
- Nowhere-zero integer flow in regular matroids Matt DeVos* Luis A. Goddyny
- The circular flow number of a 6-edge connected graph is less than four
- Removable Circuits in Binary Matroids Luis A Goddyn
- Removable Circuits in Multigraphs Luis A. Goddyn 1*
- Circular Chromatic Number of Even-Faced Projective Plane Graphs
- Cones, Lattices and Hilbert Bases of Circuits and Perfect Matchings
- A generalization of Kneser's Addition Theorem Matt DeVos, Luis Goddyn # , and Bojan Mohar +#
- Balancing Covectors Laura Chavez-Lomeli
- A generalization of Kneser's Addition Theorem Matt DeVos, Luis Goddyn*, and Bojan Moharyz
- List edge colourings of some 1-factorable multigraphs M. N. Ellingham1
- Balancing Covectors Laura Ch'avez-Lomel'i Luis Goddyn
- High Girth Graphs Avoiding a Minor are Nearly Bipartite Anna Galluccio* Luis A. Goddyny
