( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
Extremal and Degree Conditions for Path Extendability in Digraphs.

, , , и . SIAM J. Discret. Math., 31 (3): 1990-2014 (2017)

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.

Alain Hajo

Karl Hajowsky

Naziha Hajo

Alexandra Hajok

Iván Hajós

 

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

Closing the Gap on Path-Kipas Ramsey Numbers., , , , и . Electron. J. Comb., 22 (3): 3 (2015)Backbone colorings along stars and matchings in split graphs: their span is close to the chromatic number., , , и . Discuss. Math. Graph Theory, 29 (1): 143-162 (2009)Removable edges on a Hamilton cycle or outside a cycle in a 4-connected graph., , , и . Discuss. Math. Graph Theory, 41 (2): 559-587 (2021)Preface., , , и . J. Discrete Algorithms, 6 (4): 539 (2008)Computability and Complexity of Unconventional Computing Devices., , и . CoRR, (2017)PATHS AND CYCLES IN COLORED GRAPHS, , и . Electronic Notes in Discrete Mathematics, (мая 2001)An Upper Bound for the Ramsey Number of a Cycle of Length Four Versus Wheels., , , и . IJCCGGT, том 3330 из Lecture Notes in Computer Science, стр. 181-184. Springer, (2003)Computational Matter: Evolving Computational Solutions in Materials., и . GECCO (Companion), стр. 769-770. ACM, (2015)Radio Labeling with Pre-assigned Frequencies., , , , и . ESA, том 2461 из Lecture Notes in Computer Science, стр. 211-222. Springer, (2002)Algorithms for the Treewidth and Minimum Fill-in of HHD-Free Graphs., , и . WG, том 1335 из Lecture Notes in Computer Science, стр. 109-117. Springer, (1997)