( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
Disjoint cliques in regular graphs of degree seven and eight.

, и . J. Comb. Theory B, 24 (2): 233-237 (1978)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed.

T Attin

T Neumann

T Weber

T Hollemann

T Fauster

 

Другие публикации лиц с тем же именем

Domination Subdivision Numbers., , , , , и . Discussiones Mathematicae Graph Theory, 21 (2): 239-253 (2001)Self-Stabilizing Distributed Algorithm for Strong Matching in a System Graph., , , и . HiPC, том 2913 из Lecture Notes in Computer Science, стр. 66-73. Springer, (2003)1, 2-sets in graphs., , , и . Discret. Appl. Math., 161 (18): 2885-2893 (2013)Irredundant and perfect neighbourhood sets in trees., , , и . Discret. Math., 188 (1-3): 253-260 (1998)Gallai theorems for graphs, hypergraphs, and set systems., , и . Discret. Math., 72 (1-3): 35-47 (1988)Rectilinear Steiner Trees in Rectangle Trees., , и . SIAM J. Algebraic Discret. Methods, 1 (1): 70-81 (1980)Roman 2-domination., , , и . Discret. Appl. Math., (2016)Bibliography on domination in graphs and some basic definitions of domination parameters., и . Discret. Math., 86 (1-3): 257-277 (1990)Determining fastest routes using fixed schedules., и . AFIPS Spring Joint Computing Conference, стр. 1-8. ACM, (1963)Anonymous Daemon Conversion in Self-stabilizing Algorithms by Randomization in Constant Space., , , и . ICDCN, том 4904 из Lecture Notes in Computer Science, стр. 182-190. Springer, (2008)