Cited By
View all- Axenovich MChoi JLastrina MMckay TSmith JStanton B(2014)On the Chromatic Number of Subsets of the Euclidean PlaneGraphs and Combinatorics10.1007/s00373-012-1249-930:1(71-81)Online publication date: 1-Jan-2014
Let $G$ be a graph and let $c: V(G)\to\binom{1,\ldots,5}{2}$ be an assignment of $2$-element subsets of the set $1,\ldots,5$ to the vertices of $G$ such that for every edge $vw$, the sets $c(v)$ and $c(w)$ are disjoint. We call such an assignment a $(5,...
A 2-edge-colored graph or a signed graph is a simple graph with two types of edges. A homomorphism from a 2-edge-colored graph G to a 2-edge-colored graph H is a mapping φ : V ( G ) → V ( H ) that maps every edge in G to an edge of the same type ...
Let G be a graph and let c: V(G)->({1,...,5}2)be an assignment of 2-elements subsets of the set {1,...,5} to the vertices of G such that for any two adjacent vertices u and v,c(u) and c(v) are disjoint. Call such a coloring c a (5, 2)-coloring of G. A ...
John Wiley & Sons, Inc.
United States