( en | de | ru )

 

Disambiguation of "Chudnovsky, Maria"

Author of the publication

copydeleteadd this publication to your clipboard
Pure pairs. X. Tournaments and the strong Erdős-Hajnal property.

, , , and . Eur. J. Comb., (January 2024)

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. You can also use the button next to the name to display some publications already assigned to the person.

Petra Marialke-Kandaouroff

Manuel Mariadasa

Boris Mariacher

Malaiyalam Mariappan

Norman Marian

 

Other publications of authors with the same name

Induced subgraphs of graphs with large chromatic number. XII. Distant stars., , and . J. Graph Theory, 92 (3): 237-254 (2019)Tournaments and the strong Erdős-Hajnal Property., , , and . Eur. J. Comb., (2022)On the Maximum Weight Independent Set Problem in Graphs without Induced Cycles of Length at Least Five., , , and . SIAM J. Discret. Math., 34 (2): 1472-1483 (2020)Cops and Robbers on \(P_5\)-Free Graphs., , , and . SIAM J. Discret. Math., 38 (1): 845-856 (March 2024)Better 3-coloring algorithms: Excluding a triangle and a seven vertex path., , , , , , and . Theor. Comput. Sci., (2021)Quasi-polynomial time approximation schemes for the Maximum Weight Independent Set Problem in H-free graphs., , , and . SODA, page 2260-2278. SIAM, (2020)On the Maximum Weight Independent Set Problem in graphs without induced cycles of length at least five., , , and . CoRR, (2019)The structure of claw-free graphs., and . BCC, volume 327 of London Mathematical Society Lecture Note Series, page 153-171. Cambridge University Press, (2005)Approximately Coloring Graphs Without Long Induced Paths., , , , and . WG, volume 10520 of Lecture Notes in Computer Science, page 193-205. Springer, (2017)Strengthening Rödl's theorem., , , and . J. Comb. Theory B, (November 2023)