Michael O. Albertson

János Pach

Michael E. Young

Ars Math. Contemp., 2011

More results on r-inflated graphs: Arboricity, thickness, chromatic number and fractional chromatic number.

[BibT_eX]

[DOI]

Ellen Gethner

Ars Math. Contemp., 2011

2010

Grünbaum colorings of toroidal triangulations.

[BibT_eX]

[DOI]

Hannah Alpert

sarah-marie belcastro

J. Graph Theory, 2010

The thickness and chromatic number of r-inflated graphs.

[BibT_eX]

[DOI]

Ellen Gethner

Discret. Math., 2010

2009

Crossings, Colorings, and Cliques.

[BibT_eX]

[DOI]

Daniel W. Cranston

Jacob Fox

Electron. J. Comb., 2009

2008

Automorphisms and Distinguishing Numbers of Geometric Cliques.

[BibT_eX]

[DOI]

Discret. Comput. Geom., 2008

Chromatic number, independence ratio, and crossing number.

[BibT_eX]

[DOI]

Ars Math. Contemp., 2008

2007

Using Determining Sets to Distinguish Kneser Graphs.

[BibT_eX]

[DOI]

Electron. J. Comb., 2007

2006

Distinguishing geometric graphs.

[BibT_eX]

[DOI]

J. Graph Theory, 2006

Extending precolorings to circular colorings.

[BibT_eX]

[DOI]

Douglas B. West

J. Comb. Theory, Ser. B, 2006

Coloring Vertices and Faces of Locally Planar Graphs.

[BibT_eX]

[DOI]

Bojan Mohar

Graphs Comb., 2006

2005

Distinguishing Cartesian Powers of Graphs.

[BibT_eX]

[DOI]

Electron. J. Comb., 2005

2004

Precoloring Extensions of Brooks' Theorem.

[BibT_eX]

[DOI]

Alexandr V. Kostochka

Douglas B. West

SIAM J. Discret. Math., 2004

Extending precolorings of subgraphs of locally planar graphs.

[BibT_eX]

[DOI]

Eur. J. Comb., 2004

Coloring with no 2-Colored P<sub>4</sub>'s.

[BibT_eX]

[DOI]

Electron. J. Comb., 2004

2002

Graph Color Extensions: When Hadwiger's Conjecture and Embeddings Help.

[BibT_eX]

[DOI]

Electron. J. Comb., 2002

2001

Extending colorings of locally planar graphs.

[BibT_eX]

[DOI]

J. Graph Theory, 2001

Extending graph colorings using no extra colors.

[BibT_eX]

[DOI]

Emily H. Moore

Discret. Math., 2001

2000

Partial list colorings.

[BibT_eX]

[DOI]

Sara Grossman

Discret. Math., 2000

1999

Extending Graph Colorings.

[BibT_eX]

[DOI]

Emily H. Moore

J. Comb. Theory, Ser. B, 1999

1998

You Can't Paint Yourself into a Corner.

[BibT_eX]

[DOI]

J. Comb. Theory, Ser. B, 1998

1997

The edge chromatic difference sequence of a cubic graph.

[BibT_eX]

[DOI]

Discret. Math., 1997

The Irregularity of a Graph.

[BibT_eX]

Ars Comb., 1997

1996

Bounding Functions and Rigid Graphs.

[BibT_eX]

[DOI]

SIAM J. Discret. Math., 1996

Parsimonious edge coloring.

[BibT_eX]

[DOI]

Discret. Math., 1996

Symmetry Breaking in Graphs.

[BibT_eX]

[DOI]

Karen L. Collins

Electron. J. Comb., 1996

1994

Lower bounds for constant degree independent sets.

[BibT_eX]

[DOI]

Discret. Math., 1994

1993

Independence and graph homomorphisms graph homomorphisms.

[BibT_eX]

[DOI]

Lily Chan

J. Graph Theory, 1993

1992

Turán theorems with repeated degrees.

[BibT_eX]

[DOI]

Discret. Math., 1992

1991

The number of cut-vertices in a graph of given minimum degree.

[BibT_eX]

[DOI]

David M. Berman

Discret. Math., 1991

1990

Graphs with homeomorphically irreducible spanning trees.

[BibT_eX]

[DOI]

J. Graph Theory, 1990

1989

The subchromatic number of a graph.

[BibT_eX]

[DOI]

Robert E. Jamison

Stephen T. Hedetniemi

Stephen C. Locke

Discret. Math., 1989

1985

Homomorphisms of 3-chromatic graphs.

[BibT_eX]

[DOI]

Karen L. Collins

Discret. Math., 1985

1984

Duality and perfection for edges in cliques.

[BibT_eX]

[DOI]

Karen L. Collins

J. Comb. Theory, Ser. B, 1984

1980

The chromatic difference sequence of a graph.

[BibT_eX]

[DOI]

David M. Berman

J. Comb. Theory, Ser. B, 1980

Hadwiger's conjecture for graphs on the Klein bottle.

[BibT_eX]

[DOI]

Discret. Math., 1980

Critical graphs for chromatic difference sequences.

[BibT_eX]

[DOI]

David M. Berman

Discret. Math., 1980

1978

On the independence ratio of a graph.

[BibT_eX]

[DOI]

J. Graph Theory, 1978

1973

A case of hadwiger's conjecture.

[BibT_eX]

[DOI]