Conditional colorings of graphs

13 years 4 months ago

Download www.math.wvu.edu

For an integer r > 0, a conditional (k, r)-coloring of a graph G is a proper k-coloring of the vertices of G such that every vertex of degree at least r in G will be adjacent to vertices with at least r different colors. The smallest integer k for which a graph G has a conditional k-coloring is the r-conditional chromatic number r(G). In this paper, the behavior and bounds of conditional chromatic number of a graph G and its generalization are investigated. Key words: conditional coloring, conditional chromatic number.

Hong-Jian Lai, Jianliang Lin, Bruce Montgomery, Ta

Real-time Traffic

Chromatic Number | Conditional Chromatic Number | DM 2006 | R-conditional Chromatic Number |

claim paper

» Refining the Graph Density Condition for the Existence of Almost Kfactors

» Adapted List Coloring of Graphs and Hypergraphs

» Some Topological Methods in Graph Coloring Theory

» Algebraic characterization of uniquely vertex colorable graphs

» A simple condition implying rapid mixing of singlesite dynamics on spin systems

» Distributed Functional Compression through Graph Coloring

» Cycles and paths in edgecolored graphs with given degrees

» Functional compression through graph coloring

Post Info
More Details (n/a)

Added	11 Dec 2010
Updated	11 Dec 2010
Type	Journal
Year	2006
Where	DM
Authors	Hong-Jian Lai, Jianliang Lin, Bruce Montgomery, Taozhi Shui, Suohai Fan

Comments (0)

Sciweavers

Conditional colorings of graphs

Chromatic Number | Conditional Chromatic Number | DM 2006 | R-conditional Chromatic Number |

Explore & Download

Productivity Tools

Document Tools

Image Tools

Sciweavers