On indexable graphs. - S. Arumugam 001; K. Augustine Germina (Discret. Math., 1996)

On Edge Coloring of Hypergraphs and ERDöS-Faber-LováSZ Conjecture. - Viji Paul; K. Augustine Germina (Discret. Math. Algorithms Appl., 2012)

On composition of signed graphs. - K. Augustine Germina; Koombail Shahul Hameed (Discuss. Math. Graph Theory, 2012)

On the Distance Pattern Distinguishing Number of a Graph. - Sona Jose; K. Augustine Germina (J. Appl. Math., 2014)

On co-regular signed graphs. - Koombail Shahul Hameed; Viji Paul; K. Augustine Germina (Australas. J Comb., 2015)

On hypergraph coloring and 3-uniform linear hypergraph set-indexers of a graph. - Viji Paul; K. Augustine Germina (Discret. Math. Algorithms Appl., 2015)

Some new results on strong integer additive set-indexers of graphs. - N. K. Sudev; K. Augustine Germina (Discret. Math. Algorithms Appl., 2015)

On certain arithmetic integer additive set-indexers of graphs. - N. K. Sudev; K. Augustine Germina (Discret. Math. Algorithms Appl., 2015)

Constructions of 1-Uniform dcsl graphs using Well-graded families of sets. - K. Nageswara Rao; P. Shaini; K. Augustine Germina (Electron. Notes Discret. Math., 2016)

Learning graphs and 1-uniform dcsl graphs. - Jinto James; K. Augustine Germina; P. Shaini (Discret. Math. Algorithms Appl., 2017)

Switched signed graphs of integer additive set-valued signed graphs. - Sudev Naduvath; K. P. Chithra; K. Augustine Germina (Discret. Math. Algorithms Appl., 2017)

On certain coloring parameters of Mycielski graphs of some graphs. - N. K. Sudev; K. P. Chithra; K. Augustine Germina; S. Satheesh; Johan Kok (Discret. Math. Algorithms Appl., 2018)

Results on uniquely colorable digraphs. - K. Dhanalakshmi; K. Augustine Germina; J. Amalorpava Jerline; L. Benedict Michael Raj (Discret. Math. Algorithms Appl., 2021)

On two Laplacian matrices for skew gain graphs. - Roshni T. Roy; Koombail Shahul Hameed; K. Augustine Germina (Electron. J. Graph Theory Appl., 2021)

Edge (m, k)-choosability of graphs. - P. Soorya; K. Augustine Germina (Discret. Math. Algorithms Appl., 2022)