Homomorphically full graphs are those for which every homomorphic image ...
In this work we consider arc criticality in colourings of oriented graph...
A 2-edge-colored graph or a signed graph is a simple graph with two type...
An oriented graph (2-edge-coloured graph) is complete convex when the
co...
In this short note we show that every connected 2-edge coloured cubic gr...
In this short note we show that every connected oriented cubic graph adm...
We show that any orientation of a graph with maximum degree three has an...
The Shapley-Shubik power index is a measure of each voters power in the
...
The oriented chromatic polynomial of a oriented graph outputs the number...
An (m,n)-mixed graph generalizes the notions of oriented graphs and
edge...
For oriented graphs G and H, a homomorphism f: G → H is
locally-injectiv...