On the size of Edge-Chromatic critical graphs. - K. Kayathri (Graphs Comb., 1994)

There are no edge-chromatic 4-critical graphs of order 12. - Sheshayya A. Choudum; K. Kayathri (Discret. Math., 1995)

An extension of Vizing's adjacency lemma on edge chromatic critical graphs. - Sheshayya A. Choudum; K. Kayathri (Discret. Math., 1999)

Edge Complete (p, 2) Semigraphs. - K. Kayathri; S. Pethanachi Selvam (Ars Comb., 2007)

Enumeration Of Non-Isomorphic Semigraphs In Γ4. - K. Kayathri; S. Pethanachi Selvam (Ars Comb., 2015)

(1, 2)-Domination in Graphs. - K. Kayathri; S. Vallirani (ICTCSDM, 2016)

Edge-Graceful Labelings of Connected Graphs. - K. Kayathri; R. Amutha (Electron. Notes Discret. Math., 2016)

On the size of edge chromatic 5-critical graphs. - K. Kayathri; J. Sakila Devi (AKCE Int. J. Graphs Comb., 2017)