( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
Upper bounds on the k-forcing number of a graph.

, , , и . Discret. Appl. Math., (2015)

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.

Yair Schiftan

Thomas Caro

Walter Caro

Erich Caro

Erich Caro

 

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

Exact cuts and a simple proof of the zero graphs theorem.. Ars Comb., (1995)Generalized 1-factorization of trees., и . Discret. Math., 33 (3): 319-321 (1981)Intersecting Designs., и . J. Comb. Theory A, 89 (1): 113-125 (2000)A Complete Characterization of the Zero-Sum (mod 2) Ramsey Numbers.. J. Comb. Theory A, 68 (1): 205-211 (1994)On graphs determined by their k-subgraphs.. Ars Comb., (1998)The decomposition of trees into subtrees.. J. Graph Theory, 8 (4): 471-479 (1984)Improved lower bounds on k-independence., и . J. Graph Theory, 15 (1): 99-107 (1991)Zero-sum delta-systems and multiple copies of graphs., и . J. Graph Theory, 32 (2): 207-216 (1999)Large disjoint subgraphs with the same order and size., и . Eur. J. Comb., 30 (4): 813-821 (2009)On non-z(mod k) dominating sets., и . Discussiones Mathematicae Graph Theory, 23 (1): 189-199 (2003)