Conditional colorings of graphs (Q2501581): Difference between revisions
From MaRDI portal
Created a new Item |
ReferenceBot (talk | contribs) Changed an Item |
||
(5 intermediate revisions by 4 users not shown) | |||
Property / author | |||
Property / author: Jian-Liang Lin / rank | |||
Property / author | |||
Property / author: B. L. Montgomery / rank | |||
Property / reviewed by | |||
Property / reviewed by: Stanlislav Jendroľ / rank | |||
Property / author | |||
Property / author: Jian-Liang Lin / rank | |||
Normal rank | |||
Property / author | |||
Property / author: B. L. Montgomery / rank | |||
Normal rank | |||
Property / reviewed by | |||
Property / reviewed by: Stanlislav Jendroľ / rank | |||
Normal rank | |||
Property / MaRDI profile type | |||
Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Property / full work available at URL | |||
Property / full work available at URL: https://doi.org/10.1016/j.disc.2006.03.052 / rank | |||
Normal rank | |||
Property / OpenAlex ID | |||
Property / OpenAlex ID: W2097915624 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Every planar map is four colorable. I: Discharging / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Every planar map is four colorable. II: Reducibility / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q5422499 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q5782525 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q5466088 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: The four-colour theorem / rank | |||
Normal rank | |||
links / mardi / name | links / mardi / name | ||
Latest revision as of 20:27, 24 June 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Conditional colorings of graphs |
scientific article |
Statements
Conditional colorings of graphs (English)
0 references
14 September 2006
0 references
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\) is adjacent to vertices with at least \(r\) different colors. The smallest integer \(k\) for which a graph \(G\) has a conditional \((k,r)\)-coloring is the \(r\)th order conditional chromatic number. In this paper, the behavior and bounds of the conditional chromatic number of a graph \(G\) are investigated.
0 references
conditional chromatic number
0 references