Title of article
Kolmogorov random graphs only have trivial stable colorings
Author/Authors
Qi Cheng، نويسنده , , Fang Fang، نويسنده ,
Issue Information
دوهفته نامه با شماره پیاپی سال 2002
Pages
4
From page
133
To page
136
Keywords
Kolmogorov complexity , Combinatorial problems , regular graph , Graph automorphism
Journal title
Information Processing Letters
Serial Year
2002
Journal title
Information Processing Letters
Record number
129453
Link To Document