Choice number of some complete multi-partite graphs

Hikoe Enomoto; Kyoji Ohba; Katsuhiro Ota; Junko Sakamoto

doi:10.1016/S0012-365X(01)00059-0

Choice number of some complete multi-partite graphs

Hikoe Enomoto, Kyoji Ohba, Katsuhiro Ota, Junko Sakamoto

Department of Mathematics

Research output: Contribution to journal › Conference article › peer-review

20 Citations (Scopus)

Abstract

One of the authors has conjectured that every graph G with 2%(G) + 1 or fewer vertices is χ(G)-choosable. Motivated by this, we investigate the choice numbers of some complete k-partite graphs of order slightly larger than 2k, and settle the conjecture for some special cases. We also present several complete multi-partite graphs whose choice numbers are not equal to their chromatic numbers.

Original language	English
Pages (from-to)	55-66
Number of pages	12
Journal	Discrete Mathematics
Volume	244
Issue number	1-3
DOIs	https://doi.org/10.1016/S0012-365X(01)00059-0
Publication status	Published - 2002 Feb 6
Event	Algebraic and Topological Methods in Graph Theory (ATMGT) - Lake Bled, Slovenia Duration: 1999 Jun 28 → 1999 Jul 2

Keywords

Complete
List coloring
Multi-partite graphs

ASJC Scopus subject areas

Theoretical Computer Science
Discrete Mathematics and Combinatorics

Access to Document

10.1016/S0012-365X(01)00059-0

Cite this

@article{cd45bc3c35a2419e88ef32f8d1907c91,

title = "Choice number of some complete multi-partite graphs",

abstract = "One of the authors has conjectured that every graph G with 2%(G) + 1 or fewer vertices is χ(G)-choosable. Motivated by this, we investigate the choice numbers of some complete k-partite graphs of order slightly larger than 2k, and settle the conjecture for some special cases. We also present several complete multi-partite graphs whose choice numbers are not equal to their chromatic numbers.",

keywords = "Complete, List coloring, Multi-partite graphs",

author = "Hikoe Enomoto and Kyoji Ohba and Katsuhiro Ota and Junko Sakamoto",

year = "2002",

month = feb,

day = "6",

doi = "10.1016/S0012-365X(01)00059-0",

language = "English",

volume = "244",

pages = "55--66",

journal = "Discrete Mathematics",

issn = "0012-365X",

publisher = "Elsevier",

number = "1-3",

note = "Algebraic and Topological Methods in Graph Theory (ATMGT) ; Conference date: 28-06-1999 Through 02-07-1999",

}

TY - JOUR

T1 - Choice number of some complete multi-partite graphs

AU - Enomoto, Hikoe

AU - Ohba, Kyoji

AU - Ota, Katsuhiro

AU - Sakamoto, Junko

PY - 2002/2/6

Y1 - 2002/2/6

N2 - One of the authors has conjectured that every graph G with 2%(G) + 1 or fewer vertices is χ(G)-choosable. Motivated by this, we investigate the choice numbers of some complete k-partite graphs of order slightly larger than 2k, and settle the conjecture for some special cases. We also present several complete multi-partite graphs whose choice numbers are not equal to their chromatic numbers.

AB - One of the authors has conjectured that every graph G with 2%(G) + 1 or fewer vertices is χ(G)-choosable. Motivated by this, we investigate the choice numbers of some complete k-partite graphs of order slightly larger than 2k, and settle the conjecture for some special cases. We also present several complete multi-partite graphs whose choice numbers are not equal to their chromatic numbers.

KW - Complete

KW - List coloring

KW - Multi-partite graphs

UR - http://www.scopus.com/inward/record.url?scp=33750981870&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=33750981870&partnerID=8YFLogxK

U2 - 10.1016/S0012-365X(01)00059-0

DO - 10.1016/S0012-365X(01)00059-0

M3 - Conference article

AN - SCOPUS:33750981870

SN - 0012-365X

VL - 244

SP - 55

EP - 66

JO - Discrete Mathematics

JF - Discrete Mathematics

IS - 1-3

T2 - Algebraic and Topological Methods in Graph Theory (ATMGT)

Y2 - 28 June 1999 through 2 July 1999

ER -

Choice number of some complete multi-partite graphs

Abstract

Keywords

ASJC Scopus subject areas

Access to Document

Other files and links

Fingerprint

Cite this