<s>
The	O
Misra	B-Algorithm
&	I-Algorithm
Gries	I-Algorithm
edge	I-Algorithm
coloring	I-Algorithm
algorithm	I-Algorithm
is	O
a	O
polynomial	O
time	O
algorithm	O
in	O
graph	O
theory	O
that	O
finds	O
an	O
edge	O
coloring	O
of	O
any	O
graph	O
.	O
</s>
<s>
This	O
can	O
be	O
shown	O
by	B-Algorithm
induction	I-Algorithm
on	O
the	O
number	O
of	O
colored	O
edges	O
.	O
</s>
<s>
Induction	B-Algorithm
step	I-Algorithm
:	O
suppose	O
this	O
was	O
true	O
at	O
the	O
end	O
of	O
the	O
previous	O
iteration	O
.	O
</s>
