Discussiones Mathematicae Graph Theory > 2010 > 30 > 1 > 115-122
Source
Abstract
Identifiers
journal ISSN : | 2083-5892 |
DOI | 10.7151/dmgt.1481 |
Authors
Keywords
Additional information
Publisher
Fields of science
Bibliography
-
[1] K. Ando, H. Enomoto and A. Saito, Contractible edges in 3-connected graphs, J. Combin. Theory (B) 42 (1987) 87-93, doi: 10.1016/0095-8956(87)90065-7.
-
[2] O.V. Borodin, Solution of Ringel's problem on vertex-face coloring of plane graphs and coloring of 1-planar graphs (Russian), Met. Diskr. Anal. 41 (1984) 12-26.
-
[3] H. Enomoto and M. Hornák, A general upper bound for the cyclic chromatic number of 3-connected plane graphs, J. Graph Theory 62 (2009) 1-25, doi: 10.1002/jgt.20383.