Minimal non-extensible precolorings and implicit-relations

Details Minimal non-extensible precolorings and implicit-relations Minimal non-extensible precolorings and implicit-relations

2011-04-04

arxiv.org/abs/1104.0510v1

Mathematics

Combinatorics

Scientific paper

In this paper I study a variant of the general vertex coloring problem called precoloring. Specifically, I study graph precolorings, by developing new theory, for characterizing the minimal non-extensible precolorings. It is interesting per se that, for graphs of arbitrarily large chromatic number, the minimal number of colored vertices, in a non-extensible precoloring, remains constant; only two vertices $u,v$ suffice. Here, the relation between such $u,v$ is called an implicit-relation, distinguishing two cases: (i) implicit-edges where $u,v$ are precolored with the same color and (ii) implicit-identities where $u,v$ are precolored distinct.

Affiliated with

Also associated with

No associations

Rating

Minimal non-extensible precolorings and implicit-relations does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Minimal non-extensible precolorings and implicit-relations, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Minimal non-extensible precolorings and implicit-relations will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-317614