RECURSIVE COLORINGS OF HIGHLY RECURSIVE GRAPHSKIERSTEAD HA.1981; CAN. J. MATH.; ISSN 0008-414X; CAN; DA. 1981; VOL. 32; NO 6; PP. 1279-1290; BIBL. 13 REF.Article

On Schmerl's effective version of Brooks' theoremTVERBERG, H.Journal of combinatorial theory. Series B. 1984, Vol 37, Num 1, pp 27-30, issn 0095-8956Article

On-line coloring and recursive graph theoryKIERSTEAD, H. A; PENRICE, S. G; TROTTER, W. T et al.SIAM journal on discrete mathematics (Print). 1994, Vol 7, Num 1, pp 72-89, issn 0895-4801Article

On the complexity of finding the chromatic number of a recursive graph. I: The bounded caseBEIGEL, R; GASARCH, W. I.Annals of pure and applied logic. 1989, Vol 45, Num 1, pp 1-38, issn 0168-0072, 38 p.Article

Pancyclicity of recursive circulant graphsARAKI, Toru; SHIBATA, Yukio.Information processing letters. 2002, Vol 81, Num 4, pp 187-190, issn 0020-0190Article

Complexité des systèmes d'information : une famille de mesures de la complexité scalaire d'un schéma d'architectureCASEAU, Yves; KROB, Daniel; PEYRONNET, Sylvain et al.Génie logiciel (1995). 2007, Num 82, pp 23-30, issn 1265-1397, 8 p.Article

On the strength of König's duality theorem for infinite bipartite graphsAHARONI, R; MAGIDOR, M; SHORE, R. A et al.Journal of combinatorial theory. Series B. 1992, Vol 54, Num 2, pp 257-290, issn 0095-8956Article