4 papers
On the matching complexes of categorical product of path graphs
Raju Kumar Gupta, Sourav Sarkar, Sagar S. Sawant +1
The matching complex of a graph is a simplicial complex whose simplices are matchings in . These complexes appear in various places and found applications in…
Proper -caterpillars are distinguished by their Chromatic Symmetric Functions
G. Arunkumar, Narayanan Narayanan, Raghavendra Rao B. V. +1
Stanley's Tree Isomorphism Conjecture posits that the chromatic symmetric function can distinguish non-isomorphic trees. While already established for caterpillars and other subcla…
Complexity of Near-3-Choosability Problem
Sounaka Mishra, Rohini S, Sagar S. Sawant
It is currently an unsolved problem to determine whether a -free planar graph contains an independent set such that is -choosable. However…
On distinguishing digraphs by its quasisymmetric B-polynomial
N. Narayanan, Sagar S. Sawant
The -polynomial defined by J. Awan and O. Bernardi is a generalization of Tutte Polynomial to digraphs. In this paper, we solve an open question raised by J. Awan and O. Bernard…