Showing cs.DMShow all
2 papers · 1 filter
cs.DM2017
Equitable neighbour-sum-distinguishing edge and total colourings
Olivier Baudon, Monika Pilsniak, Jakub Przybylo +3
With any (not necessarily proper) edge -colouring of a graph ,one can associate a vertex colouring given by $σ\_γ(v)=\sum\_{e\ni v…
cs.DM2010
Upper oriented chromatic number of undirected graphs and oriented colorings of product graphs
Eric Sopena
The oriented chromatic number of an oriented graph is the minimum order of an oriented graph $\vev H$ such that admits a homomorphism to $\vev H$. The oriented ch…