( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
Tight Bounds on the Clique Chromatic Number.

, , , и . Electron. J. Comb., (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.

Nicholas Reed

Wallace Kwesi Bruce-Tamakloe

Cecil Bruce-Boye

Philippa Reed

Sean Reed

 

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

Odd cycle packing., и . STOC, стр. 695-704. ACM, (2010)Hadwiger's conjecture is decidable., и . STOC, стр. 445-454. ACM, (2009)Approximate Min-max Relations for Odd Cycles in Planar Graphs., , , и . IPCO, том 3509 из Lecture Notes in Computer Science, стр. 35-50. Springer, (2005)Non-Interfering Network Flows., , , и . SWAT, том 621 из Lecture Notes in Computer Science, стр. 245-257. Springer, (1992)An Improved Algorithm for Finding Tree Decompositions of Small Width., и . WG, том 1665 из Lecture Notes in Computer Science, стр. 148-154. Springer, (1999)Approximately covering by cycles in planar graphs., и . SODA, стр. 402-406. ACM/SIAM, (2001)Polychromatic Hamilton cycles., и . Discret. Math., 118 (1-3): 69-74 (1993)An (almost) Linear Time Algorithm for Odd Cyles Transversal., и . SODA, стр. 365-378. SIAM, (2010)Partitioning Into Prescribed Number of Cycles and Mod k T-join With Slack., , , и . LAGOS, том 195 из Procedia Computer Science, стр. 12-20. Elsevier, (2021)Properly 2-Colouring Linear Hypergraphs., и . APPROX-RANDOM, том 4627 из Lecture Notes in Computer Science, стр. 395-408. Springer, (2007)