Characterization of \((2m,m)\)-paintable graphs (Q2344816)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 6436276
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Characterization of \((2m,m)\)-paintable graphs |
scientific article; zbMATH DE number 6436276 |
Statements
Characterization of \((2m,m)\)-paintable graphs (English)
0 references
18 May 2015
0 references
Summary: In this paper, we prove that for any graph \(G\) and any positive integer \(m\), \(G\) is \((2m,m)\)-paintable if and only if \(G\) is 2-paintable. It was asked by \textit{X. Zhu} [Electron. J. Comb. 16, No. 1, Research Paper R127, 16 p. (2009; Zbl 1186.05061)] whether \(k\)-paintable graphs are \((km,m)\)-paintable for any positive integer \(m\). Our result answers this question in the affirmative for \(k=2\).
0 references
painting game
0 references
on-line List colouring
0 references
paint number
0 references
fractional paint number
0 references
0.7915215492248535
0 references
0.749204158782959
0 references
