|
[1]
|
Mycieslski, J. (1995) Sur le coloriage des graphes. Colloqutum Mathematicum, 3, 23-29.
|
|
[2]
|
Larsen, M., Propp, J. and Ullman, D. (1995) The Fractional Chromatic Number of Mycielski’s Graphs. Journal of Graph Theory, 19, 411-416. [Google Scholar] [CrossRef]
|
|
[3]
|
Fisher, D.C., McKenna, P. and Boyer, E.D. (1998) Hamiltionicity, Diameter, Domination Number, Packing Number, and Biclique Partitions of Mycielski’s Graphs. Discrete Applied Mathematics, 84, 93-105. [Google Scholar] [CrossRef]
|
|
[4]
|
Chang, G.J., Huang, L. and Zhu, X. (1999) Circular Chromatic Numbers of Mycielski’s Graphs. Discrete Mathematics, 205, 23-37. [Google Scholar] [CrossRef]
|
|
[5]
|
Došlić, T. (2005) Mycielskians and Matchings, Discussiones. Discussiones Mathematicae Graph Theory, 25, 261-266. [Google Scholar] [CrossRef]
|
|
[6]
|
Bar Lam, P.C., Lin, W., Gu, G.H. and Song, Z.M. (2003) Circular Chromatic Number and a Generalization of the Construction of Mycielskian. Journal of Combinatorial Theory, Series B, 89, 195-205. [Google Scholar] [CrossRef]
|
|
[7]
|
Lin, W., Wu, J., Bar Lam, P.C. and Gu, G.H. (2006) Several Parameters of Generalized Mycielskians. Discrete Applied Mathematics, 154, 1173-1182. [Google Scholar] [CrossRef]
|
|
[8]
|
Ma, L., Bian, H. and Yu, H. (2020) Hamiltonicity and Factor-Critical of Generalized Mycielskian.
|
|
[9]
|
Lovász, L. and Plummer, M.D. (1986) Matching Theory, Annual Discrete Mathematics, North-Holland, Amsterdam
|