Some totally 4-choosable multigraphs
Discussiones Mathematicae Graph Theory (2007)
- Volume: 27, Issue: 3, page 425-455
- ISSN: 2083-5892
Access Full Article
topAbstract
topHow to cite
topReferences
top- [1] N. Alon and M. Tarsi, Colorings and orientations of graphs, Combinatorica 12 (1992) 125-134, doi: 10.1007/BF01204715. Zbl0756.05049
- [2] O.V. Borodin, A.V. Kostochka and D.R. Woodall, List edge and list total colourings of multigraphs, J. Combin. Theory (B) 71 (1997) 184-204, doi: 10.1006/jctb.1997.1780. Zbl0876.05032
- [3] O.V. Borodin, A.V. Kostochka and D.R. Woodall, Total colourings of planar graphs with large girth, European J. Combin. 19 (1998) 19-24, doi: 10.1006/eujc.1997.0152. Zbl0886.05065
- [4] A. Chetwynd, Total colourings of graphs, in: R. Nelson and R.J. Wilson, eds, Graph Colourings (Milton Keynes, 1988), Pitman Res. Notes Math. Ser. 218 (Longman Sci. Tech., Harlow, 1990) 65-77.
- [5] P. Erdös, A.L. Rubin and H. Taylor, Choosability in graphs, in: Proc. West Coast Conference on Combinatorics, Graph Theory and Computing, Arcata, 1979, Congr. Numer. 26 (1980) 125-157.
- [6] M. Juvan, B. Mohar and R. Skrekovski, List total colourings of graphs, Combin. Probab. Comput. 7 (1998) 181-188, doi: 10.1017/S0963548397003210. Zbl0911.05033
- [7] L. Lovász, Three short proofs in graph theory, J. Combin. Theory (B) 19 (1975) 269-271, doi: 10.1016/0095-8956(75)90089-1. Zbl0322.05142
- [8] V.G. Vizing, Colouring the vertices of a graph in prescribed colours (in Russian), Metody Diskret. Analiz. 29 (1976) 3-10.
- [9] W. Wang, Total chromatic number of planar graphs with maximum degree 10, J. Graph Theory 54 (2007) 91-102, doi: 10.1002/jgt.20195. Zbl1110.05037
- [10] D.R. Woodall, List colourings of graphs, in: J.W.P. Hirschfeld, ed., Surveys in Combinatorics, 2001, London Math. Soc. Lecture Note Ser. 288 (Cambridge Univ. Press, Cambridge, 2001) 269-301. Zbl0979.05047