加载中…
2012-10-17
Graphs whose edge set can be partitioned into maximum matchings
Niraj Khare
文献摘要
This article provides structural characterization of simple graphs whose edge-set can be partitioned into maximum matchings. We use Vizing’s classification of simple graphs based on edge chromatic index.
讨论
0讲解博客
生成讲解博客的中文版本
AI智能校验
生成AI智能校验的中文版本