Garth Isaak

Matthew Prudente

Int. J. Game Theory, 2021

2019

Interval orders with two interval lengths.

[BibT_eX]

[DOI]

Simona Boyadzhiyska

Ann N. Trenk

Discret. Appl. Math., 2019

2012

Integer and fractional security in graphs.

[BibT_eX]

[DOI]

Peter D. Johnson Jr.

Caleb Petrie

Discret. Appl. Math., 2012

Distinguishing numbers of Cartesian products of multiple complete graphs.

[BibT_eX]

[DOI]

Michael J. Fisher

Ars Math. Contemp., 2012

2011

Star-critical Ramsey numbers.

[BibT_eX]

[DOI]

Jonelle Hook

Discret. Appl. Math., 2011

2010

Linear Time Recognition Algorithms and Structure Theorems for Bipartite Tolerance Graphs and Bipartite Probe Interval Graphs.

[BibT_eX]

[DOI]

David E. Brown

Arthur H. Busch

Discret. Math. Theor. Comput. Sci., 2010

The Edge-Count Criterion for Graphic Lists.

[BibT_eX]

[DOI]

Douglas B. West

Electron. J. Comb., 2010

2009

Greedy rankings and arank numbers.

[BibT_eX]

[DOI]

Robert E. Jamison

Inf. Process. Lett., 2009

Interval Order Representation via Shortest Paths.

[BibT_eX]

[DOI]

Proceedings of the Mathematics of Preference, Choice and Order, 2009

2008

Distinguishing colorings of Cartesian products of complete graphs.

[BibT_eX]

[DOI]

Michael J. Fisher

Discret. Math., 2008

2007

Recognizing Bipartite Tolerance Graphs in Linear Time.

[BibT_eX]

[DOI]

Arthur H. Busch

Proceedings of the Graph-Theoretic Concepts in Computer Science, 2007

2006

Hamiltonicity of digraphs for universal cycles of permutations.

[BibT_eX]

[DOI]

Eur. J. Comb., 2006

2004

Maximum Antichains of Sets of Distinct Sizes: 10932.

[BibT_eX]

[DOI]

Christian Bey

Am. Math. Mon., 2004

Complete classification of tournaments having a disjoint union of directed paths as a minimum feedback arc set.

[BibT_eX]

[DOI]

J. Graph Theory, 2004

A classification of tournaments having an acyclic tournament as a minimum feedback arc set.

[BibT_eX]

[DOI]

Inf. Process. Lett., 2004

Sum List Coloring Block Graphs.

[BibT_eX]

[DOI]

Graphs Comb., 2004

2003

A Hierarchy of Classes of Bounded Bitolerance Orders.

[BibT_eX]

Kathryn L. Nyman

Ann N. Trenk

Ars Comb., 2003

2002

Sum List Coloring 2*n Arrays.

[BibT_eX]

[DOI]

Electron. J. Comb., 2002

2001

Comparability Invariance Results for Tolerance Orders.

[BibT_eX]

[DOI]

Order, 2001

2000

Representations of graphs modulo <i>n</i>.

[BibT_eX]

[DOI]

Anthony B. Evans

Discret. Math., 2000

1999

Hamiltonian powers in threshold and arborescent comparability graphs.

[BibT_eX]

[DOI]

Sam Donnelly

Discret. Math., 1999

1998

Powers of Hamiltonian paths in interval graphs.

[BibT_eX]

[DOI]

J. Graph Theory, 1998

Proper and unit bitolerance orders and graphs.

[BibT_eX]

[DOI]

Kenneth P. Bogart

Discret. Math., 1998

1997

On Higher Dimensional Perfect Factors.

[BibT_eX]

Ars Comb., 1997

1996

Equivalence class universal cycles for permutations.

[BibT_eX]

[DOI]

Discret. Math., 1996

1995

New Constructions for De Bruijn Tori.

[BibT_eX]

[DOI]

Des. Codes Cryptogr., 1995

Scheduling Dyadic Intervals.

[BibT_eX]

[DOI]

James R. Driscoll

Dennis M. Healy Jr.

Discret. Appl. Math., 1995

Proper and Unit Tolerance Graphs.

[BibT_eX]

[DOI]

Discret. Appl. Math., 1995

The Reversing Number of a Digraph.

[BibT_eX]

[DOI]

Jean-Pierre Barthélemy

Discret. Appl. Math., 1995

Tournaments as Feedback Arc Sets.

[BibT_eX]

[DOI]

Electron. J. Comb., 1995

1993

On the de Bruijn Torus Problem.

[BibT_eX]

J. Comb. Theory A, 1993

Bounded Discrete Representations of Interval Orders.

[BibT_eX]

[DOI]