Drimit Pattanayak

most citedThe linear arboricity conjecture for graphs of low degeneracy

1 citations · 1 across the 2 of their papers we have counts for

collaborators

2 papers

math.CO2022

A $p$ -centered coloring for the grid using $O (p)$ colors

Mathew Francis, Drimit Pattanayak

A $p$ -centered coloring of a graph $G$ , where $p$ is a positive integer, is a coloring of the vertices of $G$ in such a way that every connected subgraph of $G$ either contains a v…

math.CO2020★ 1 cited

The linear arboricity conjecture for graphs of low degeneracy

Manu Basavaraju, Arijit Bishnu, Mathew Francis +1

A linear forest is an acyclic graph whose each connected component is a path; or in other words, it is an acyclic graph whose maximum degree is at most 2. A linear coloring of a gr…

A p-centered coloring for the grid using O(p) colors

The linear arboricity conjecture for graphs of low degeneracy

A $p$ -centered coloring for the grid using $O (p)$ colors