王维凡,张克民
WANG Wei-Fan, ZHANG Ke-Min
摘要:
Let G be an outerplane graph with maximum degree and the entire chro-
matic number vef (G). This paper proves that if 6, then + 1 vef (G) + 2,
and vef (G) = + 1 if and only if G has a matching M consisting of some inner edges
which covers all its vertices of maximum degree.
中图分类号: