L. Sunil Chandran

From MaRDI portal
Person:300471

Available identifiers

zbMath Open chandran.l-sunilWikidataQ131848544 ScholiaQ131848544MaRDI QIDQ300471

List of research outcomes





PublicationDate of PublicationType
List recoloring of planar graphs2025-01-27Paper
Variants of the Gyárfás-Sumner conjecture: oriented trees and rainbow paths2024-11-24Paper
Total domination, separated-cluster, CD-coloring: algorithms and hardness2024-05-31Paper
Weakening total coloring conjecture and Hadwiger's conjecture on total graphs2024-02-19Paper
New bounds on the anti-Ramsey numbers of star graphs via maximum edge \(q\)-coloring2024-02-19Paper
\(s\)-club cluster vertex deletion on interval and well-partitioned chordal graphs2024-01-09Paper
$\chi$-binding functions for squares of bipartite graphs and its subclasses2023-12-14Paper
\(s\)-club cluster vertex deletion on interval and well-partitioned chordal graphs2023-05-05Paper
Template-driven rainbow coloring of proper interval graphs2023-02-22Paper
https://portal.mardi4nfdi.de/entity/Q58757932023-02-03Paper
List recoloring of planar graphs2022-09-13Paper
On graphs whose eternal vertex cover number and vertex cover number coincide2022-08-04Paper
Improved approximation for maximum edge colouring problem2022-08-04Paper
Upper bounding rainbow connection number by forest number2022-05-17Paper
Template-driven rainbow coloring of proper interval graphs2022-03-24Paper
Algorithms and complexity of \(s\)-club cluster vertex deletion2022-03-22Paper
Edge-coloured graphs with only monochromatic perfect matchings and their connection to quantum physics2022-02-11Paper
Variants of the Gy\`arf\`as-Sumner Conjecture: Oriented Trees and Rainbow Paths2021-11-25Paper
Spanning tree congestion and computation of generalized Győri-Lovász partition2021-07-28Paper
List distinguishing number of \(p^{\text{th}}\) power of hypercube and Cartesian powers of a graph2020-07-21Paper
Algorithms and bounds for very strong rainbow coloring2020-02-12Paper
On Eulerian orientations of even-degree hypercubes2020-02-10Paper
Combinatorial lower bounds for 3-query LDCs2019-11-24Paper
On graphs with minimal eternal vertex cover number2019-10-10Paper
On induced colourful paths in triangle-free graphs2019-02-20Paper
Hadwiger's conjecture for squares of 2-trees2018-12-20Paper
Separation dimension and sparsity2018-10-31Paper
On the parameterized complexity of biclique cover and partition2018-04-10Paper
On induced colourful paths in triangle-free graphs2018-01-18Paper
Sublinear approximation algorithms for boxicity and related problems2018-01-11Paper
Algorithms and Bounds for Very Strong Rainbow Coloring2017-03-01Paper
Inapproximability of Rainbow Colouring2017-02-21Paper
Rainbow colouring of split graphs2016-11-24Paper
Hadwiger's conjecture and squares of chordal graphs2016-09-02Paper
Separation dimension of graphs and hypergraphs2016-06-28Paper
Upper bound on cubicity in terms of boxicity for graphs of low chromatic number2015-12-08Paper
Separation dimension of bounded degree graphs2015-11-27Paper
Boxicity and separation dimension2015-09-09Paper
Heterochromatic paths in edge colored graphs without small cycles and heterochromatic-triangle-free graphs2015-06-02Paper
Boxicity and cubicity of product graphs2015-06-02Paper
Lower bounds for boxicity2015-05-07Paper
Rainbow matchings in strongly edge-colored graphs2015-04-01Paper
Rainbow connection number of graph power and graph products2015-01-20Paper
Representing a cubic graph as the intersection graph of axis-parallel boxes in three dimensions2014-12-22Paper
2-connecting outerplanar graphs without blowing up the pathwidth2014-10-06Paper
Rainbow connection number and radius2014-09-19Paper
A constant factor approximation algorithm for boxicity of circular arc graphs2014-09-12Paper
Product dimension of forests and bounded treewidth graphs2014-08-14Paper
Cubicity, degeneracy, and crossing number2014-07-29Paper
On Additive Combinatorics of Permutations of \mathbb{Z}_n2014-07-01Paper
https://portal.mardi4nfdi.de/entity/Q54199712014-06-11Paper
Separation dimension of sparse graphs2014-04-17Paper
Bipartite powers of \(k\)-chordal graphs2014-02-14Paper
Rainbow connection number and connected dominating sets2013-11-01Paper
Cubicity of interval graphs and the claw number2013-10-10Paper
On the \(SIG\)-dimension of trees under the \(L_\infty\)-metric2013-07-19Paper
Cubicity and bandwidth2013-02-25Paper
Polynomial time and parameterized approximation algorithms for boxicity2013-01-07Paper
Pairwise Suitable Family of Permutations and Boxicity2012-12-30Paper
Acyclic edge coloring of triangle-free planar graphs2012-11-23Paper
Maximum weight independent sets in hole- and dart-free graphs2012-10-19Paper
Isoperimetric Sequences for Infinite Complete Binary Trees, Meta-Fibonacci Sequences and Signed Almost Binary Partitions2012-10-01Paper
Rainbow Colouring of Split and Threshold Graphs2012-09-25Paper
Rainbow connection number and connected dominating sets2012-09-12Paper
Cubicity, degeneracy, and crossing number2012-08-31Paper
Rainbow connection number and connectivity2012-06-12Paper
Boxicity of line graphs2012-04-13Paper
Boxicity and poset dimension2012-03-15Paper
Acyclic edge coloring of 2-degenerate graphs2012-02-08Paper
Boxicity of leaf powers2012-01-24Paper
Chordal bipartite graphs with high boxicity2012-01-24Paper
Boxicity of circular arc graphs2012-01-24Paper
Acyclic edge-coloring of planar graphs2011-10-27Paper
A constant factor approximation algorithm for boxicity of circular arc graphs2011-08-12Paper
On the arrangement of cliques in chordal graphs with respect to the cuts2011-06-29Paper
Isoperimetric inequalities and the width parameters of graphs2011-03-18Paper
Cubicity of interval graphs and the claw number2010-12-14Paper
The hardness of approximating the boxicity, cubicity and threshold dimension of a graph2010-11-05Paper
On the cubicity of bipartite graphs2010-08-16Paper
Boxicity and poset dimension2010-07-20Paper
Boxicity and cubicity of asteroidal triple free graphs2010-05-05Paper
A note on the Hadwiger number of circular arc graphs2010-03-24Paper
d‐Regular graphs of acyclic chromatic index at least d+22010-03-15Paper
Geometric representation of graphs in low dimension using axis parallel boxes2010-02-23Paper
On the structure of contractible edges in \(k\)-connected partial \(k\)-trees2010-01-18Paper
On the cubicity of AT-free graphs and circular-arc graphs2010-01-07Paper
Acyclic edge coloring of graphs with maximum degree 42009-12-18Paper
A note on acyclic edge coloring of complete bipartite graphs2009-12-10Paper
On the cubicity of interval graphs2009-12-09Paper
On the cubicity of certain graphs2009-12-04Paper
Refined memorization for vertex cover2009-08-27Paper
Minimum cuts, girth and a spectral threshold2009-07-09Paper
Boxicity of Halin graphs2009-06-23Paper
Cubicity, boxicity, and vertex cover2009-06-19Paper
An upper bound for cubicity in terms of boxicity2009-06-19Paper
Hadwiger's conjecture for proper circular arc graphs2009-06-17Paper
Hadwiger number and the Cartesian product of graphs2009-04-29Paper
A spectral lower bound for the treewidth of a graph and its consequences2009-04-28Paper
Bounds on isoperimetric values of trees2009-04-09Paper
A lower bound for the hitting set size for combinatorial rectangles and an application2009-03-23Paper
Acyclic edge coloring of subcubic graphs2009-01-28Paper
The cubicity of hypercube graphs2009-01-28Paper
Isoperimetric Problem and Meta-fibonacci Sequences2008-07-10Paper
On the Cubicity of Interval Graphs2008-06-05Paper
Boxicity and maximum degree2008-03-14Paper
Geometric Representation of Graphs in Low Dimension2007-09-10Paper
The stable set problem and the thinness of a graph2007-08-27Paper
Boxicity and treewidth2007-08-20Paper
https://portal.mardi4nfdi.de/entity/Q34396782007-05-29Paper
On the relationship between ATSP and the cycle cover problem2007-02-26Paper
On the Hadwiger's conjecture for graph products2007-02-13Paper
Boxicity of series-parallel graphs2006-10-19Paper
The carvingwidth of hypercubes2006-10-19Paper
On the Boxicity and Cubicity of Hypercubes2006-05-10Paper
The treewidth and pathwidth of hypercubes2006-03-29Paper
A linear time algorithm to list the minimal separators of chordal graphs2006-03-29Paper
Parameterized and Exact Computation2005-08-23Paper
Computing and Combinatorics2005-06-15Paper
https://portal.mardi4nfdi.de/entity/Q46676252005-04-20Paper
On the Number of Minimum Cuts in a Graph2005-02-28Paper
Girth and treewidth2005-02-09Paper
https://portal.mardi4nfdi.de/entity/Q48086422004-08-12Paper
https://portal.mardi4nfdi.de/entity/Q47368422004-08-11Paper
A High Girth Graph Construction2004-01-08Paper
https://portal.mardi4nfdi.de/entity/Q45513692002-09-05Paper
https://portal.mardi4nfdi.de/entity/Q45513782002-09-05Paper
https://portal.mardi4nfdi.de/entity/Q45016782000-11-07Paper

Research outcomes over time

This page was built for person: L. Sunil Chandran