On Uniquely 3-Colorable Plane Graphs without Adjacent Faces of Prescribed Degrees

On Uniquely 3-Colorable Plane Graphs without Adjacent Faces of Prescribed Degrees

A graph <i>G</i> is <i>uniquely k-colorable</i> if the chromatic number of <i>G</i> is <i>k</i> and <i>G</i> has only one <i>k</i>-coloring up to the permutation of the colors. For a plane graph <i>G</i>, two faces &...

Full description

Bibliographic Details
Main Authors: Zepeng Li, Naoki Matsumoto, Enqiang Zhu, Jin Xu, Tommy Jensen
Format: Article
Language:English
Published: MDPI AG 2019-09-01
Series:Mathematics
Subjects:
plane graph
unique coloring
uniquely three-colorable plane graph
construction
adjacent (<i>i</i>,<i>j</i>)-faces
Online Access:https://www.mdpi.com/2227-7390/7/9/793

Internet

https://www.mdpi.com/2227-7390/7/9/793

Similar Items