Analogues of Cliques for (m,n)-colored Mixed Graphs - Archive ouverte HAL Access content directly
Journal Articles Graphs and Combinatorics Year : 2017

Analogues of Cliques for (m,n)-colored Mixed Graphs


An (m,n)-colored mixed graph is a mixed graph with arcs assigned one of m different colors and edges one of n different colors. A homomorphism of an (m,n)-colored mixed graph G to an (m,n)-colored mixed graph H is a vertex mapping such that if uv is an arc (edge) of color c in G, then f(u)f(v) is also an arc (edge) of color c. The (m,n)-colored mixed chromatic number, denoted chi_{m,n}(G), of an (m,n)-colored mixed graph G is the order of a smallest homomorphic image of G. An (m,n)-clique is an (m,n)-colored mixed graph C with chi_{m,n}(C) = |V(C)|. Here we study the structure of (m,n)-cliques. We show that almost all (m,n)-colored mixed graphs are (m,n)-cliques, prove bounds for the order of a largest outerplanar and planar (m,n)-clique and resolve an open question concerning the computational complexity of a decision problem related to (0,2)-cliques. Additionally, we explore the relationship between chi_{1,0} and chi_{0,2}.
Fichier principal
Vignette du fichier
BDS_May18.pdf (283.46 Ko) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

hal-01078218 , version 1 (28-10-2014)
hal-01078218 , version 2 (20-05-2015)
hal-01078218 , version 3 (07-11-2017)



Julien Bensmail, Christopher Duffy, Sagnik Sen. Analogues of Cliques for (m,n)-colored Mixed Graphs. Graphs and Combinatorics, 2017, 33 (4), pp.735-750. ⟨10.1007/s00373-017-1807-2⟩. ⟨hal-01078218v3⟩
532 View
282 Download



Gmail Facebook X LinkedIn More