Extending partial colorings of graphs

Henry Kierstead

doi:10.1016/S0012-365X(99)00372-6

Extending partial colorings of graphs

Henry Kierstead

Mathematical and Statistical Sciences, School of (SoMSS)

Research output: Contribution to journal › Article › peer-review

Abstract

Recently, several authors have considered the problem of extending a partial coloring of a graph to a complete coloring. We show how similar results can be extracted from old proofs on recursive colorings of highly recursive graphs.

Original language	English (US)
Pages (from-to)	145-152
Number of pages	8
Journal	Discrete Mathematics
Volume	219
Issue number	1-3
DOIs	https://doi.org/10.1016/S0012-365X(99)00372-6
State	Published - May 28 2000

ASJC Scopus subject areas

Theoretical Computer Science
Discrete Mathematics and Combinatorics

Access to Document

10.1016/S0012-365X(99)00372-6

Cite this

@article{d01fb45af47044e981febe6facd92136,

title = "Extending partial colorings of graphs",

abstract = "Recently, several authors have considered the problem of extending a partial coloring of a graph to a complete coloring. We show how similar results can be extracted from old proofs on recursive colorings of highly recursive graphs.",

author = "Henry Kierstead",

year = "2000",

month = may,

day = "28",

doi = "10.1016/S0012-365X(99)00372-6",

language = "English (US)",

volume = "219",

pages = "145--152",

journal = "Discrete Mathematics",

issn = "0012-365X",

publisher = "Elsevier",

number = "1-3",

}

TY - JOUR

T1 - Extending partial colorings of graphs

AU - Kierstead, Henry

PY - 2000/5/28

Y1 - 2000/5/28

N2 - Recently, several authors have considered the problem of extending a partial coloring of a graph to a complete coloring. We show how similar results can be extracted from old proofs on recursive colorings of highly recursive graphs.

AB - Recently, several authors have considered the problem of extending a partial coloring of a graph to a complete coloring. We show how similar results can be extracted from old proofs on recursive colorings of highly recursive graphs.

UR - http://www.scopus.com/inward/record.url?scp=0347016278&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=0347016278&partnerID=8YFLogxK

U2 - 10.1016/S0012-365X(99)00372-6

DO - 10.1016/S0012-365X(99)00372-6

M3 - Article

AN - SCOPUS:0347016278

SN - 0012-365X

VL - 219

SP - 145

EP - 152

JO - Discrete Mathematics

JF - Discrete Mathematics

IS - 1-3

ER -

Extending partial colorings of graphs

Abstract

ASJC Scopus subject areas

Access to Document

Other files and links

Fingerprint

Cite this