Michael O. Albertson

According to our database1, Michael O. Albertson authored at least 39 papers between 1973 and 2011.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of two.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

On csauthors.net:

Bibliography

2011
Disjoint homometric sets in graphs.
Ars Math. Contemp., 2011

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

2010
Grünbaum colorings of toroidal triangulations.
Journal of Graph Theory, 2010

The thickness and chromatic number of r-inflated graphs.
Discrete Mathematics, 2010

2009
Crossings, Colorings, and Cliques.
Electr. J. Comb., 2009

2008
Automorphisms and Distinguishing Numbers of Geometric Cliques.
Discrete & Computational Geometry, 2008

Chromatic number, independence ratio, and crossing number.
Ars Math. Contemp., 2008

2007
Using Determining Sets to Distinguish Kneser Graphs.
Electr. J. Comb., 2007

2006
Distinguishing geometric graphs.
Journal of Graph Theory, 2006

Extending precolorings to circular colorings.
J. Comb. Theory, Ser. B, 2006

Coloring Vertices and Faces of Locally Planar Graphs.
Graphs and Combinatorics, 2006

2005
Distinguishing Cartesian Powers of Graphs.
Electr. J. Comb., 2005

2004
Precoloring Extensions of Brooks' Theorem.
SIAM J. Discrete Math., 2004

Extending precolorings of subgraphs of locally planar graphs.
Eur. J. Comb., 2004

Coloring with no 2-Colored P4's.
Electr. J. Comb., 2004

2002
Graph Color Extensions: When Hadwiger's Conjecture and Embeddings Help.
Electr. J. Comb., 2002

2001
Extending colorings of locally planar graphs.
Journal of Graph Theory, 2001

Extending graph colorings using no extra colors.
Discrete Mathematics, 2001

2000
Partial list colorings.
Discrete Mathematics, 2000

1999
Extending Graph Colorings.
J. Comb. Theory, Ser. B, 1999

1998
You Can't Paint Yourself into a Corner.
J. Comb. Theory, Ser. B, 1998

1997
The edge chromatic difference sequence of a cubic graph.
Discrete Mathematics, 1997

The Irregularity of a Graph.
Ars Comb., 1997

1996
Bounding Functions and Rigid Graphs.
SIAM J. Discrete Math., 1996

Parsimonious edge coloring.
Discrete Mathematics, 1996

Symmetry Breaking in Graphs.
Electr. J. Comb., 1996

1994
Lower bounds for constant degree independent sets.
Discrete Mathematics, 1994

1993
Independence and graph homomorphisms graph homomorphisms.
Journal of Graph Theory, 1993

1992
Turán theorems with repeated degrees.
Discrete Mathematics, 1992

1991
The number of cut-vertices in a graph of given minimum degree.
Discrete Mathematics, 1991

1990
Graphs with homeomorphically irreducible spanning trees.
Journal of Graph Theory, 1990

1989
The subchromatic number of a graph.
Discrete Mathematics, 1989

1985
Homomorphisms of 3-chromatic graphs.
Discrete Mathematics, 1985

1984
Duality and perfection for edges in cliques.
J. Comb. Theory, Ser. B, 1984

1980
The chromatic difference sequence of a graph.
J. Comb. Theory, Ser. B, 1980

Hadwiger's conjecture for graphs on the Klein bottle.
Discrete Mathematics, 1980

Critical graphs for chromatic difference sequences.
Discrete Mathematics, 1980

1978
On the independence ratio of a graph.
Journal of Graph Theory, 1978

1973
A case of hadwiger's conjecture.
Discrete Mathematics, 1973


  Loading...