research
∙
06/13/2023
An update on (n,m)-chromatic numbers
An (n,m)-graph is a graph with n types of arcs and m types of edges. A h...
share
research
∙
06/13/2023
On relative clique number of triangle-free planar (n,m)-graphs
An (n,m)-graph is a graph with n types of arcs and m types of edges. A h...
research
∙
01/31/2023
New bounds and constructions for neighbor-locating colorings of graphs
A proper k-coloring of a graph G is a neighbor-locating k-coloring if fo...
research
∙
08/22/2022
The oriented relative clique number of triangle-free planar graphs is 10
In relation to oriented coloring and chromatic number, the parameter ori...
research
∙
04/15/2021
On clique numbers of colored mixed graphs
An (m,n)-colored mixed graph, or simply, an (m,n)-graph is a graph havin...
research
∙
09/25/2020
On the signed chromatic number of some classes of graphs
A signed graph (G, σ) is a graph G along with a function σ: E(G) →{+,-}....
research
∙
11/22/2019
Pushable chromatic number of graphs with degree constraints
Pushable homomorphisms and the pushable chromatic number χ_p of oriented...
research
∙
10/12/2018
On relative clique number of colored mixed graphs
An (m, n)-colored mixed graph is a graph having arcs of m different colo...
research
∙
10/12/2018