( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
Tight Co-Degree Condition for Perfect Matchings in 4-Graphs.

, и . Electron. J. Comb., 19 (2): 20 (2012)

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.

Andrzej Piotrowski

Andrzej Tomczyk

Andrzej Debski

Andrzej Lingas

Andrzej Szczerbakow

 

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

Distributed Approximation Algorithms for Planar Graphs., , и . CIAC, том 3998 из Lecture Notes in Computer Science, стр. 296-307. Springer, (2006)An Extension of the Hajnal-Szemerédi Theorem to Directed Graphs., , , и . Comb. Probab. Comput., 24 (5): 754-773 (2015)Tight Co-Degree Condition for Packing of Loose Cycles in 3-Graphs.. J. Graph Theory, 83 (4): 317-333 (2016)Tight Co-Degree Condition for Perfect Matchings in 4-Graphs., и . Electron. J. Comb., 19 (2): 20 (2012)Girth, Pebbling, and Grid Thresholds., и . SIAM J. Discret. Math., 20 (1): 1-10 (2006)A Note on Graph Pebbling., , , и . Graphs Comb., 18 (2): 219-225 (2002)Distributed algorithms for weighted problems in sparse graphs., и . J. Discrete Algorithms, 4 (4): 588-607 (2006)On the pebbling threshold of paths and the pebbling threshold spectrum., и . Discret. Math., 308 (15): 3297-3307 (2008)Distributed Approximation Algorithms in Unit-Disk Graphs., и . DISC, том 4167 из Lecture Notes in Computer Science, стр. 385-398. Springer, (2006)Brief Announcement: Distributed Approximations for the Semi-matching Problem., , , , и . DISC, том 6950 из Lecture Notes in Computer Science, стр. 200-201. Springer, (2011)