On-line choice number of complete multipartite graphs: An algorithmic approach

Fei Huang Chang*, Jun Yi Guo, Hong Bin Chen, Yu Pei Huang

*此作品的通信作者

研究成果: 雜誌貢獻期刊論文同行評審

摘要

This paper studies the on-line choice number of complete multipartite graphs with independence number m. We give a unified strategy for every prescribed m.Our main result leads to several interesting consequences comparable to known results. (1) If (Formula Presented)where kp denotes the number of parts of cardinality p, then G is on-line chromatic-choosable. (2) If (Formula Presented)then G is on-line chromatic-choosable. (3) The on-line choice number of regular complete multipartite graphs Km*k is at most k for (Formula Presented).

原文英語
期刊Electronic Journal of Combinatorics
22
發行號1
DOIs
出版狀態已發佈 - 2015 一月 2

ASJC Scopus subject areas

  • 理論電腦科學
  • 幾何和拓撲
  • 離散數學和組合
  • 計算機理論與數學
  • 應用數學

指紋

深入研究「On-line choice number of complete multipartite graphs: An algorithmic approach」主題。共同形成了獨特的指紋。

引用此