K. Kayathri

According to our database, K. Kayathri authored at least 8 papers between 1994 and 2017.

Collaborative distances:

• Dijkstra number of five.
• Erdős number of four.

2017

On the size of edge chromatic 5-critical graphs.

K. Kayathri, J. Sakila Devi

AKCE Int. J. Graphs Comb., 2017

2016

Edge-Graceful Labelings of Connected Graphs.

K. Kayathri, R. Amutha

Electron. Notes Discret. Math., 2016

(1, 2)-Domination in Graphs.

K. Kayathri, S. Vallirani

Proceedings of the Theoretical Computer Science and Discrete Mathematics, 2016

2015

Enumeration Of Non-Isomorphic Semigraphs In Γ₄.

K. Kayathri, S. Pethanachi Selvam

Ars Comb., 2015

2007

Edge Complete (p, 2) Semigraphs.

K. Kayathri, S. Pethanachi Selvam

Ars Comb., 2007

1999

An extension of Vizing's adjacency lemma on edge chromatic critical graphs.

Sheshayya A. Choudum, K. Kayathri

Discret. Math., 1999

1995

There are no edge-chromatic 4-critical graphs of order 12.

Sheshayya A. Choudum, K. Kayathri

Discret. Math., 1995

1994

On the size of Edge-Chromatic critical graphs.

K. Kayathri

Graphs Comb., 1994