9 citations · 15 across the 23 of their papers we have counts for
Showing 2014 · math.COShow all
2 papers · 2 filters
math.CO2014
Outerplanar and planar oriented cliques
Ayan Nandy, Sagnik Sen, Eric Sopena
The clique number of an undirected graph is the maximum order of a complete subgraph of and is a well-known lower bound for the chromatic number of . Every proper -co…
math.CO2014★ 2 cited
Analogous to cliques for (m,n)-colored mixed graphs
Julien Bensmail, Christopher Duffy, Sagnik Sen
Vertex coloring of a graph with -colors can be equivalently thought to be a graph homomorphism (edge preserving vertex mapping) of to the complete graph of order $…