|
|
Sibirskie Èlektronnye Matematicheskie Izvestiya [Siberian Electronic Mathematical Reports], 2008, Volume 5, Pages 685–690
(Mi semr138)
|
|
|
|
Research papers
On planar graphs without list $3$-coloring
V. A. Tashkinov Sobolev Institute of Mathematics, Siberian Branch of the Russian Academy of Sciences
Abstract:
We construct a planar graph without $4$-and $5$-cycles and without intersecting triangles that has $366$ vertices and no list $3$-coloring from a set of $4$ colors.
Keywords:
planar graph, list coloring, $3$-choosability.
Received August 14, 2008, published December 16, 2008
Citation:
V. A. Tashkinov, “On planar graphs without list $3$-coloring”, Sib. Èlektron. Mat. Izv., 5 (2008), 685–690
Linking options:
https://www.mathnet.ru/eng/semr138 https://www.mathnet.ru/eng/semr/v5/p685
|
| Statistics & downloads: |
| Abstract page: | 266 | | Full-text PDF : | 75 | | References: | 71 |
|