Home

About

Advanced Search

Browse by Discipline

Scientific Societies

E-print Alerts

Add E-prints

E-print Network
FAQHELPSITE MAPCONTACT US


  Advanced Search  

 
The Thickness and Chromatic Number of r-Inflated Graphs Michael O. Albertson
 

Summary: The Thickness and Chromatic Number of r-Inflated Graphs
Michael O. Albertson
L. Clark Seelye Professor
Department of Mathematics and Statistics
Smith College, Northampton MA 01063
Debra L. Boutin
Department of Mathematics
Hamilton College, Clinton, NY 13323
dboutin@hamilton.edu
Ellen Gethner
Department of Computer Science
Department of Mathematics
University of Colorado Denver, Denver, CO 80217
ellen.gethner@ucdenver.edu
Keywords: graph coloring, chromatic number, thickness, r-inflation, independence num-
ber, arboricity
Dedicated to Carsten Thomassen on the occasion of his 60th birthday.
Abstract
A graph has thickness t if the edges can be decomposed into t and no fewer planar
layers. We study one aspect of a generalization of Ringel's famous Earth-Moon prob-

  

Source: Albertson, Michael O. - Department of Mathematics and Statistics, Smith College

 

Collections: Mathematics