共 50 条
Online list coloring for signed graphs
被引:0
|作者:
Tupper, M.
[1
]
White, J. A.
[1
]
机构:
[1] Univ Texas Rio Grande Valley, Sch Math & Stat Sci, 1201 West Univ Dr, Edinburg, TX 78539 USA
来源:
关键词:
online list coloring;
chromatic number;
signed graphs;
D O I:
10.12958/adm1806
中图分类号:
O29 [应用数学];
学科分类号:
070104 ;
摘要:
We generalize the notion of online list coloring to signed graphs. We define the online list chromatic number of a signed graph, and prove a generalization of Brooks' Theorem. We also give necessary and sufficient conditions for a signed graph to be degree paintable, or degree choosable. Finally, we classify the 2-list-colorable and 2-list-paintable signed graphs.
引用
收藏
页码:151 / 172
页数:22
相关论文