Edge-chromatic numbers of Mycielski graphs

2012

In this paper, we show that the Mycielski graph M(G) of a graph G is Class I except when G=K"2.

Keywords:

Correction
Source
Cite
Save
Machine Reading By IdeaReader

13

References

1

Citations