( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
Blockers for Simple Hamiltonian Paths in Convex Geometric Graphs of Odd Order.

, и . Discret. Comput. Geom., 65 (2): 425-449 (2021)

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.

Chaya Arora

Chaya Arora

Kantika Chayawattanangkur

Chayarop Supanchart

Ataollah Chayan

 

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

Blockers for Simple Hamiltonian Paths in Convex Geometric Graphs of Even Order., и . Discret. Comput. Geom., 60 (1): 1-8 (2018)On Sets of n Points in General Position That Determine Lines That Can Be Pierced by n Points., и . Discret. Comput. Geom., 64 (3): 905-915 (2020)Error Resilient Space Partitioning (Invited Talk)., , , , , , и . ICALP, том 198 из LIPIcs, стр. 4:1-4:22. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2021)From a (p, 2)-Theorem to a Tight (p, q)-Theorem., и . Discret. Comput. Geom., 63 (4): 821-847 (2020)No Krasnoselskii number for general sets in R2., и . CoRR, (2020)A Solution to Ringel's Circle Problem., , , , и . SoCG, том 224 из LIPIcs, стр. 33:1-33:14. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2022)Reconstruction of the Path Graph., и . CoRR, (2018)No Krasnoselskii Number for General Sets., и . SoCG, том 189 из LIPIcs, стр. 47:1-47:11. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2021)An (ℵ₀, k+2)-Theorem for k-Transversals., и . SoCG, том 224 из LIPIcs, стр. 50:1-50:14. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2022)On the Number of Hyperedges in the Hypergraph of Lines and Pseudo-Discs., , и . Electron. J. Comb., (2022)