2 papers
math.CO2021
On clique numbers of colored mixed graphs
Dipayan Chakraborty, Sandip Das, Soumen Nandi +2
An (m,n)-colored mixed graph, or simply, an (m,n)-graph is a graph having m different types of arcs and n different types of edges. A homomorphism of an (m,n)-graph G to another (m…
cs.DM2018
On relative clique number of colored mixed graphs
Sandip Das, Soumen Nandi, Debdeep Roy +1
An -colored mixed graph is a graph having arcs of different colors and edges of different colors. A graph homomorphism of an )-colored mixed graph to an…