( en | de | ru )

 

Disambiguation of "Chandran, L. Sunil"

Author of the publication

copydeleteadd this publication to your clipboard
New bounds on the anti-Ramsey numbers of star graphs via maximum edge q-coloring.

, , , , , and . Discret. Math., 347 (4): 113894 (April 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.

Chandran Vijayendran

C Sunil Kumar

Manjari Chandran

Sunil Kumar

Sunil Thakur

 

Other publications of authors with the same name

Rainbow Connection Number and Radius., , , and . Graphs Comb., 30 (2): 275-285 (2014)Towards a conjecture on the recoloring diameter of planar graphs., , and . CoRR, (2022)A Constant Factor Approximation Algorithm for Boxicity of Circular Arc Graphs., , and . WADS, volume 6844 of Lecture Notes in Computer Science, page 13-24. Springer, (2011)Polynomial Time and Parameterized Approximation Algorithms for Boxicity., , and . IPEC, volume 7535 of Lecture Notes in Computer Science, page 135-146. Springer, (2012)On the Number of Minimum Cuts in a Graph., and . COCOON, volume 2387 of Lecture Notes in Computer Science, page 220-229. Springer, (2002)On the Arrangement of Cliques in Chordal Graphs with Respect to the Cuts., and . COCOON, volume 3106 of Lecture Notes in Computer Science, page 151-160. Springer, (2004)Rainbow Connection Number and Connected Dominating Sets., , , and . Electron. Notes Discret. Math., (2011)Krenn-Gu Conjecture for Sparse Graphs., , and . MFCS, volume 306 of LIPIcs, page 41:1-41:15. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2024)Algorithms and Bounds for Very Strong Rainbow Coloring., , , and . LATIN, volume 10807 of Lecture Notes in Computer Science, page 625-639. Springer, (2018)s-Club Cluster Vertex Deletion on Interval and Well-Partitioned Chordal Graphs., , , and . WG, volume 13453 of Lecture Notes in Computer Science, page 129-143. Springer, (2022)