The Size of Edge-critical Uniquely 3-Colorable Planar Graphs

Electronic Journal Of Combinatorics

Naoki Matsumoto¹ 

关键词: Graph theory;    Planar graphs;    Unique coloring;   

DOI  :  

学科分类：离散数学和组合数学

来源: Electronic Journal Of Combinatorics

【 摘 要 】

A graph $G$ is uniquely $k$-colorable if the chromatic number of $G$ is $k$ and $G$ has only one $k$-coloring up to permutation of the colors. A uniquely $k$-colorable graph $G$ is edge-critical if $G-e$ is not a uniquely $k$-colorable graph for any edge

【 授权许可】

Others