Choice number of some complete multi-partite graphs

Hikoe Enomoto, Kyoji Ohba, Katsuhiro Ota, Junko Sakamoto

Research output: Contribution to journalArticle

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 languageEnglish
Pages (from-to)55-66
Number of pages12
JournalDiscrete Mathematics
Volume244
Issue number1-3
Publication statusPublished - 2002 Feb 6

Fingerprint

Complete multipartite Graph
Graph in graph theory
Chromatic number

Keywords

  • Complete
  • List coloring
  • Multi-partite graphs

ASJC Scopus subject areas

  • Discrete Mathematics and Combinatorics
  • Theoretical Computer Science

Cite this

Enomoto, H., Ohba, K., Ota, K., & Sakamoto, J. (2002). Choice number of some complete multi-partite graphs. Discrete Mathematics, 244(1-3), 55-66.

Choice number of some complete multi-partite graphs. / Enomoto, Hikoe; Ohba, Kyoji; Ota, Katsuhiro; Sakamoto, Junko.

In: Discrete Mathematics, Vol. 244, No. 1-3, 06.02.2002, p. 55-66.

Research output: Contribution to journalArticle

Enomoto, H, Ohba, K, Ota, K & Sakamoto, J 2002, 'Choice number of some complete multi-partite graphs', Discrete Mathematics, vol. 244, no. 1-3, pp. 55-66.
Enomoto H, Ohba K, Ota K, Sakamoto J. Choice number of some complete multi-partite graphs. Discrete Mathematics. 2002 Feb 6;244(1-3):55-66.
Enomoto, Hikoe ; Ohba, Kyoji ; Ota, Katsuhiro ; Sakamoto, Junko. / Choice number of some complete multi-partite graphs. In: Discrete Mathematics. 2002 ; Vol. 244, No. 1-3. pp. 55-66.
@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 = "2",
day = "6",
language = "English",
volume = "244",
pages = "55--66",
journal = "Discrete Mathematics",
issn = "0012-365X",
publisher = "Elsevier",
number = "1-3",

}

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

M3 - Article

AN - SCOPUS:33750981870

VL - 244

SP - 55

EP - 66

JO - Discrete Mathematics

JF - Discrete Mathematics

SN - 0012-365X

IS - 1-3

ER -