Basic Examples
(
1
)
Determine if the given coloring of a complete graph with two vertices is valid:
I
n
[
1
2
6
]
:
=
[
◼
]
V
a
l
i
d
G
r
a
p
h
C
o
l
o
r
i
n
g
,
{
1
,
2
}
O
u
t
[
1
2
6
]
=
T
r
u
e
A
p
p
l
i
c
a
t
i
o
n
s
(
2
)
