( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
Crossing Number of Graphs with Rotation Systems.

, , и . GD, том 4875 из Lecture Notes in Computer Science, стр. 3-12. Springer, (2007)

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.

Michael J Thate

Michael J Grabher

Michael J Munkert

Michael J Hartmann

Michael J Schramm

 

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

Hanani-Tutte for Radial Planarity II., , и . GD, том 9801 из Lecture Notes in Computer Science, стр. 468-481. Springer, (2016)Train Tracks and Confluent Drawings., , , и . Algorithmica, 47 (4): 465-479 (2007)Hanani-Tutte and Monotone Drawings., , , и . WG, том 6986 из Lecture Notes in Computer Science, стр. 283-294. Springer, (2011)Crossing Number of Graphs with Rotation Systems., , и . GD, том 4875 из Lecture Notes in Computer Science, стр. 3-12. Springer, (2007)A Simple Characterization of Proportionally 2-choosable Graphs., , , и . Graphs Comb., 36 (3): 679-687 (2020)Flexible list colorings: Maximizing the number of requests satisfied., , , и . J. Graph Theory, 106 (4): 887-906 (2024)Dominating sets in triangulations on surfaces., и . Ars Math. Contemp., 4 (1): 177-204 (2011)Odd Crossing Number Is Not Crossing Number., , и . GD, том 3843 из Lecture Notes in Computer Science, стр. 386-396. Springer, (2005)Strong Hanani-Tutte for the Torus., , и . SoCG, том 189 из LIPIcs, стр. 38:1-38:15. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2021)Fast edge colorings with fixed number of colors to minimize imbalance., и . J. Graph Algorithms Appl., 12 (4): 401-417 (2008)