Cops and Robber is one of the most studied two-player
pursuit-evasion ga...
An (n,m)-graph is a graph with n types of arcs and m types of edges. A
h...
An (n,m)-graph is a graph with n types of arcs and m types of edges. A
h...
An oriented graph has weak diameter at most d if every non-adjacent pair...
A proper k-coloring of a graph G is a neighbor-locating
k-coloring if fo...
In 1975, Plesník characterized all triangle-free planar graphs as having...
In relation to oriented coloring and chromatic number, the parameter ori...
An (n,m)-graph has n different types of arcs and m different types of
ed...
We introduce the fractional version of oriented coloring and initiate it...
An (m,n)-colored mixed graph, or simply, an (m,n)-graph is a graph havin...
In this work we consider arc criticality in colourings of oriented graph...
For a class 𝒢 of graphs, the problem SUBGRAPH COMPLEMENT TO
𝒢 asks wheth...
A signed graph (G, σ) is a graph G along with a function σ:
E(G) →{+,-}....
Pushable homomorphisms and the pushable chromatic number χ_p of oriented...
An (m, n)-colored mixed graph is a graph having arcs of m different
colo...
An error is spotted in the statement of Theorem 1.3 of our published art...