Robert E. Jamison

Alan P. Sprague

J. Graph Theory, 2020

2018

Dyadic representations of graphs.

[BibT_eX]

[DOI]

Discret. Math., 2018

2017

Graphs constructible from cycles and complete graphs.

[BibT_eX]

[DOI]

Discret. Math., 2017

2012

Max-optimal and sum-optimal labelings of graphs.

[BibT_eX]

[DOI]

Darren A. Narayan

Inf. Process. Lett., 2012

Towards a comprehensive theory of conflict-tolerance graphs.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2012

2011

Automorphic Decompositions of Graphs.

[BibT_eX]

[DOI]

Robert A. Beeler

Graphs Comb., 2011

Orientable edge colorings of graphs.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2011

2010

Chromatically Supremal Decompositions of Graphs.

[BibT_eX]

[DOI]

Eric Mendelsohn

Graphs Comb., 2010

2009

Greedy rankings and arank numbers.

[BibT_eX]

[DOI]

Garth Isaak

Darren A. Narayan

Inf. Process. Lett., 2009

The 2-star spectrum of stars.

[BibT_eX]

[DOI]

Robert A. Beeler

Eric Mendelsohn

Australas. J Comb., 2009

2008

On the Acyclic Chromatic Number of Hamming Graphs.

[BibT_eX]

[DOI]

Gretchen L. Matthews

Graphs Comb., 2008

Turán theorems and convexity invariants for directed graphs.

[BibT_eX]

[DOI]

Beth Novick

Discret. Math., 2008

2007

On the chromatic spectrum of acyclic decompositions of graphs.

[BibT_eX]

[DOI]

Eric Mendelsohn

J. Graph Theory, 2007

2006

Rank-tolerance graph classes.

[BibT_eX]

[DOI]

J. Graph Theory, 2006

Polynomial recognition of equal unions in hypergraphs with few vertices of large degree.

[BibT_eX]

[DOI]

J. Discrete Algorithms, 2006

Acyclic colorings of products of trees.

[BibT_eX]

[DOI]

Gretchen L. Matthews

John Villalpando

Inf. Process. Lett., 2006

Partial S(k-1, k, v)'s inducing Pk-decompositions of Kv.

[BibT_eX]

[DOI]

Gaetano Quattrocchi

Australas. J Comb., 2006

2005

Canonical Pattern Ramsey Numbers.

[BibT_eX]

[DOI]

Maria Axenovich

Graphs Comb., 2005

Constant tolerance intersection graphs of subtrees of a tree.

[BibT_eX]

[DOI]

Discret. Math., 2005

Closure spaces that are not uniquely generated.

[BibT_eX]

[DOI]

John L. Pfaltz

Discret. Appl. Math., 2005

2004

On Pattern Ramsey Numbers of Graphs.

[BibT_eX]

[DOI]

Douglas B. West

Graphs Comb., 2004

On 3-simplicial vertices in planar graphs.

[BibT_eX]

[DOI]

Discuss. Math. Graph Theory, 2004

2003

Constrained Ramsey numbers of graphs.

[BibT_eX]

[DOI]

Tao Jiang

Alan C. H. Ling

J. Graph Theory, 2003

Graphs with only caterpillars as spanning trees.

[BibT_eX]

[DOI]

Fred R. McMorris

Discret. Math., 2003

The structure of (t, r)-regular graphs of large order.

[BibT_eX]

[DOI]

Peter D. Johnson Jr.

Discret. Math., 2003

Transforming Toric Digraphs.

[BibT_eX]

[DOI]

Proceedings of the Applications of Graph Transformations with Industrial Relevance, 2003

2002

Archimedean ϕ -tolerance graphs.

[BibT_eX]

[DOI]

Ann N. Trenk

J. Graph Theory, 2002

The Helly bound for singular sums.

[BibT_eX]

[DOI]

Discret. Math., 2002

2001

Closure systems and their structure.

[BibT_eX]

[DOI]

John L. Pfaltz

Inf. Sci., 2001

A note on equal unions in families of sets.

[BibT_eX]

[DOI]

Discret. Math., 2001

2000

Complexity of Recognizing Equal Unions in Families of Sets.

[BibT_eX]

[DOI]

J. Algorithms, 2000

Tolerance intersection graphs on binary trees with constant tolerance 3.

[BibT_eX]

[DOI]

Discret. Math., 2000

On a Contraction-Expansion Closure in Graphs.

[BibT_eX]

Beth Novick

Proceedings of the Participants Copies of Fifth International Seminar on Relational Methods in Computer Science, 2000

On the complexity of sign-nonsingularity and equal unions of sets.

[BibT_eX]

[DOI]

Alice A. McRae

Proceedings of the 38th Annual Southeast Regional Conference, 2000

1996

The spanning trees forced by the path and the star.

[BibT_eX]

[DOI]

Michael F. Bridgland

Jennifer S. Zito

J. Graph Theory, 1996

1992

Generating the States of a Binary Stochastic System.

[BibT_eX]

[DOI]

Douglas R. Shier

E. J. Valvo

Discret. Appl. Math., 1992

Rhythm and Pattern: Discrete Mathematics with an Artistic Connection for Elementary School Teachers.

[BibT_eX]

[DOI]

Proceedings of the Discrete Mathematics in the Schools, 1992

1990

Alternating Whitney sums and matchings in trees, part II.

[BibT_eX]

[DOI]

Discret. Math., 1990

1989

On the edge achromatic numbers of complete graphs.

[BibT_eX]

[DOI]

Discret. Math., 1989

The subchromatic number of a graph.

[BibT_eX]

[DOI]

Michael O. Albertson

Stephen T. Hedetniemi

Stephen C. Locke

Discret. Math., 1989

1987

On the Null-Homotopy of Bridged Graphs.

[BibT_eX]

[DOI]

Eur. J. Comb., 1987

Alternating Whitney sums and matchings in trees, part 1.

[BibT_eX]

[DOI]

Discret. Math., 1987

On local convexity in graphs.

[BibT_eX]

[DOI]

Martin Farber

Discret. Math., 1987

Direction Trees.

[BibT_eX]

[DOI]

Discret. Comput. Geom., 1987

1986

Few slopes without collinearity.

[BibT_eX]

[DOI]

Discret. Math., 1986

1985

The edge intersection graphs of paths in a tree.

[BibT_eX]

[DOI]

J. Comb. Theory B, 1985

Edge and vertex intersection of paths in a tree.

[BibT_eX]

[DOI]

Discret. Math., 1985

1984

Monotonicity of the mean order of subtrees.

[BibT_eX]

[DOI]

J. Comb. Theory B, 1984

A Helly theorem for convexity in graphs.

[BibT_eX]

[DOI]

Richard J. Nowakowski

Discret. Math., 1984

1983

On the average number of nodes in a subtree of a tree.

[BibT_eX]

[DOI]

J. Comb. Theory B, 1983

1977

Covering Finite Fields with Cosets of Subspaces.

[BibT_eX]

[DOI]

J. Comb. Theory A, 1977

1976

Multicolorings, measures and games on graphs.

[BibT_eX]

[DOI]

Frank H. Clarke