( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
New bounds on the anti-Ramsey numbers of star graphs via maximum edge q-coloring.

, , , , , и . Discret. Math., 347 (4): 113894 (апреля 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.

Chandran Vijayendran

C Sunil Kumar

Manjari Chandran

Sunil Kumar

Sunil Thakur

 

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

A Constant Factor Approximation Algorithm for Boxicity of Circular Arc Graphs., , и . WADS, том 6844 из Lecture Notes in Computer Science, стр. 13-24. Springer, (2011)On the Arrangement of Cliques in Chordal Graphs with Respect to the Cuts., и . COCOON, том 3106 из Lecture Notes in Computer Science, стр. 151-160. Springer, (2004)On the Number of Minimum Cuts in a Graph., и . COCOON, том 2387 из Lecture Notes in Computer Science, стр. 220-229. Springer, (2002)Polynomial Time and Parameterized Approximation Algorithms for Boxicity., , и . IPEC, том 7535 из Lecture Notes in Computer Science, стр. 135-146. Springer, (2012)Rainbow Connection Number and Radius., , , и . Graphs Comb., 30 (2): 275-285 (2014)s-Club Cluster Vertex Deletion on Interval and Well-Partitioned Chordal Graphs., , , и . WG, том 13453 из Lecture Notes in Computer Science, стр. 129-143. Springer, (2022)Representing a cubic graph as the intersection graph of axis-parallel boxes in three dimensions., и . SCG, стр. 387-396. ACM, (2012)A Combinatorial Family of Near Regular LDPC Codes., , , и . ISIT, стр. 761-765. IEEE, (2007)Rainbow Connection Number and Connected Dominating Sets., , , и . Electron. Notes Discret. Math., (2011)Two Results on LPT: A Near-Linear Time Algorithm and Parcel Delivery Using Drones., , , и . FSTTCS, том 323 из LIPIcs, стр. 17:1-17:15. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2024)