| Title:
|
On uniquely colorable graphs without short cycles (English) |
| Author:
|
Nešetřil, Jaroslav |
| Language:
|
English |
| Journal:
|
Časopis pro pěstování matematiky |
| ISSN:
|
0528-2195 |
| Volume:
|
98 |
| Issue:
|
2 |
| Year:
|
1973 |
| Pages:
|
122-125 |
| . |
| Category:
|
math |
| . |
| MSC:
|
05C15 |
| idZBL:
|
Zbl 0257.05107 |
| idMR:
|
MR0325437 |
| DOI:
|
10.21136/CPM.1973.108481 |
| . |
| Date available:
|
2009-09-23T08:26:41Z |
| Last updated:
|
2020-07-28 |
| Stable URL:
|
http://hdl.handle.net/10338.dmlcz/108481 |
| . |
| Reference:
|
[0] R. L. Brooks: On coloring the nodes of a network.Proc. Cambridge Phil. Soc. 37 (1941), 194-197. MR 0012236 |
| Reference:
|
[1] V. Chvátal: The smallest triangle free 4-chromatic 4-regular graph.(To appear). MR 0263691 |
| Reference:
|
[2] B. Griünbaum: A problem in graph coloring.(To appear). |
| Reference:
|
[3] F. Harary S. T. Hedetniemi, R. W. Robinson: Uniquely colorable graphs.J. Comb. Th. (1969), 260-270. MR 0238735 |
| Reference:
|
[4] F. Harary: Graph theory.Addison Wesley, Reading 1969. Zbl 0196.27202, MR 0256911 |
| Reference:
|
[5] L. Lovász: On chromatic number of finite set-systems.Acta Math. Acad. Sci. Hungar. 19 (1968), 59-67. MR 0220621 |
| Reference:
|
[6] / Nešetřil: $k$-chromatic graphs without cycles of length $\leq 7$.(in Russian) Comment. Math. Univ. Carolinae 7 (1966), 373-376. MR 0201346 |
| . |
