Total 4-Choosability of Series-Parallel Graphs
暂无分享,去创建一个
[1] Xiao Zhou,et al. List total colorings of series-parallel graphs , 2003, J. Discrete Algorithms.
[2] Robin Thomas,et al. List Edge-Colorings of Series-Parallel Graphs , 1999, Electron. J. Comb..
[3] Ko-Wei Lih,et al. Choosability, Edge Choosability, and Total Choosability of Outerplane Graphs , 2001, Eur. J. Comb..
[4] Douglas R. Woodall,et al. Edge and Total Choosability of Near-Outerplanar Graphs , 2006, Electron. J. Comb..
[5] Anthony J. W. Hilton,et al. The Hall Number, the Hall Index, and the Total Hall Number of a Graph , 1999, Discret. Appl. Math..
[6] G. Dirac. A Property of 4-Chromatic Graphs and some Remarks on Critical Graphs , 1952 .
[7] Béla Bollobás,et al. List-colourings of graphs , 1985, Graphs Comb..
[8] Alexandr V. Kostochka,et al. Choosability conjectures and multicircuits , 2001, Discret. Math..
[9] Alexandr V. Kostochka,et al. List Edge and List Total Colourings of Multigraphs , 1997, J. Comb. Theory B.
[10] Bojan Mohar,et al. List Total Colourings of Graphs , 1998, Combinatorics, Probability and Computing.