3 papers
math.CO2021
A linear algorithm for radio -coloring of powers of paths having small diameters
Dipayan Chakraborty, Soumen Nandi, Sagnik Sen +1
The radio -chromatic number of a graph is the minimum integer such that there exists a function satisfying $|ϕ(u)-ϕ(v)| \geq k+…
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.DM2021
On Deeply Critical Oriented Cliques
Christopher Duffy, Pavan P D, Sandeep R. B. +1
In this work we consider arc criticality in colourings of oriented graphs. We study deeply critical oriented graphs, those graphs for which the removal of any arc results in a decr…