Path Choosability of Planar Graphs

Electronic Journal Of Combinatorics

Glenn G. Chappell¹ 

关键词: Graph coloring;    List coloring;    Choosability;    Path coloring;   

DOI  :  

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

来源: Electronic Journal Of Combinatorics

【 摘 要 】

A path coloring of a graph $G$ is a vertex coloring of $G$ such that each color class induces a disjoint union of paths. We consider a path-coloring version of list coloring for planar and outerplanar graphs. We show that if each vertex of a planar graph

【 授权许可】

Others