3 citations · 9 across the 15 of their papers we have counts for
16 papers
Colouring planar graphs with a precoloured induced cycle
Ajit Diwan
Let be a cycle and a proper -colouring of for some . We say the colouring is safe if for any planar graph …
Clique factors in powers of graphs
Ajit Diwan, Aniruddha Joshi
The th power of a graph , denoted , has the same vertex set as , and two vertices are adjacent in if and only if there exists a path between them in of leng…
Chords of 2-factors in planar cubic bridgeless graphs
Ajit Diwan
We show that every edge in a 2-edge-connected planar cubic graph is either contained in a 2-edge-cut or is a chord of some cycle that is contained in a 2-factor of the graph. As a…
Another simple reformulation of the four color theorem
Ajit Diwan
We give a simple reformulation of the four color theorem as a problem on strings over a four letter alphabet.
Subdivisions of maximal 3-degenerate graphs of order in graphs of minimum degree
Ajit A. Diwan
We prove that every graph of minimum degree at least contains a subdivision of some maximal 3-degenerate graph of order . This generalizes the classic results of Dir…
The minimum forcing number of perfect matchings in the hypercube
Ajit A. Diwan
Let be a perfect matching in a graph. A subset of is said to be a forcing set of , if is the only perfect matching in the graph that contains . The minimum si…