0 KB356 KB42 KB200820252011Choo, KellyMacGillivray, Garyštevilka:1letnik:4str. 125-139COBISSID:16265049ISSN:1855-3966URN:URN:NBN:SI:doc-TG5K624IenDruštvo matematikov, fizikov in astronomov SlovenijeArs mathematica contemporaneabarvanje grafovciklična Grayjeva kodacyclic Gray codegraph colouringgraph theoryteorija grafovGray code numbers for graphs|A graph ?$H$? has a Gray code of ?$k$?-colourings if it is possible to list all of its ?$k$?-colourings in such a way that consecutive elements in the list differ in the colour of exactly one vertex. We prove that for any graph ?$H$?, there is a least integer ?$k_0(H)$? such that ?$H$? has a Gray code of ?$k$?-colourings whenever ?$k \geq k_0(H)$?. We then determine ?$k_0(H)$? whenever ?$H$? is a complete graph, tree, or cycleTEXTznanstveno časopisjejournalsSlovenian National E-content AggregatorNational and University Library of SloveniaUniverza na Primorskem, Fakulteta za naravoslovje, matematiko in informacijske tehnologije