13 citations · 39 across the 22 of their papers we have counts for
24 papers
Acyclic Edge Coloring of 3-sparse Graphs
Nevil Anto, Manu Basavaraju, Shashanka Kulamarva
A proper edge coloring of a graph without any bichromatic cycles is said to be an acyclic edge coloring of the graph. The acyclic chromatic index of a graph denoted by ,…
Upper Bounds on the Acyclic Chromatic Index of Degenerate Graphs
Nevil Anto, Manu Basavaraju, Suresh Manjanath Hegde +1
An acyclic edge coloring of a graph is a proper edge coloring without any bichromatic cycles. The acyclic chromatic index of a graph denoted by , is the minimum such…
Acyclic Chromatic Index of Chordless Graphs
Manu Basavaraju, Suresh Manjanath Hegde, Shashanka Kulamarva
An acyclic edge coloring of a graph is a proper edge coloring in which there are no bichromatic cycles. The acyclic chromatic index of a graph denoted by , is the minimu…
Gallai's Path Decomposition for 2-degenerate Graphs
Nevil Anto, Manu Basavaraju
Gallai's path decomposition conjecture states that if is a connected graph on vertices, then the edges of can be decomposed into at most pa…
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…