13 citations · 52 across the 53 of their papers we have counts for
40 papers · 1 filter
Boxicity and Cubicity of Divisor Graphs and Power Graphs
L. Sunil Chandran, Jinia Ghosh
The \textit{boxicity} (\textit{cubicity}) of an undirected graph is the smallest non-negative integer such that can be represented as the intersection graph of axis-par…
List recoloring of planar graphs
L. Sunil Chandran, Uttam K. Gupta, Dinabandhu Pradhan
A list assignment of a graph is a function that assigns to every vertex of a set of colors. A proper coloring of is called an -coloring of if…
Variants of the Gyàrfàs-Sumner Conjecture: Oriented Trees and Rainbow Paths
Manu Basavaraju, L. Sunil Chandran, Mathew C. Francis +1
Given a finite family of graphs, we say that a graph is "-free" if does not contain any graph in as a subgraph. A vertex-colored gr…
Weakening Total Coloring Conjecture: Weak TCC and Hadwiger's Conjecture on Total Graphs
Manu Basavaraju, L. Sunil Chandran, Mathew C. Francis +1
Hadwiger's conjecture is one of the most important and long-standing conjectures in graph theory. Reed and Seymour showed in 2004 that Hadwiger's conjecture is true for line graphs…
Upper Bounding Rainbow Connection Number by Forest Number
L. Sunil Chandran, Davis Issac, Juho Lauri +1
A path in an edge-colored graph is rainbow if no two edges of it are colored the same, and the graph is rainbow-connected if there is a rainbow path between each pair of its vertic…
On Induced Colourful Paths in Triangle-free Graphs
Jasine Babu, Manu Basavaraju, L. Sunil Chandran +1
Given a graph whose vertices have been properly coloured, we say that a path in is "colourful" if no two vertices in the path have the same colour. It is a corollary…