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

来源：

ALGEBRA AND DISCRETE MATHEMATICS | 2022年 / 33卷 / 02期

关键词：

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

共 8 条

[1] On colouring the nodes of a network [J].

Brooks, RL .

PROCEEDINGS OF THE CAMBRIDGE PHILOSOPHICAL SOCIETY, 1941, 37 :194-197

[2]

Erdos P., 1979, C NUMERANTUM, VXXVI, P125

[3]

Mácajová E, 2016, ELECTRON J COMB, V23

[4]

Reed B, 1998, J GRAPH THEOR, V27, P177, DOI 10.1002/(SICI)1097-0118(199804)27:4<177::AID-JGT1>3.0.CO

[5]

2-K

[6]

Schauz U., 2009, Electron. J. Combin., V16, P18

[7] SIGNED GRAPH-COLORING [J].

ZASLAVSKY, T .

DISCRETE MATHEMATICS, 1982, 39 (02) :215-228

[8]

Zhu XD, 2009, ELECTRON J COMB, V16

← 1 →