搜索结果: 1-1 共查到“离散数学 the edge”相关记录1条 . 查询时间(0.046 秒)
On spanning maximum k-edge-colorable subgraphs
maximum k-edge-colorable subgraphs Discrete Mathematics
2011/10/9
Abstract: A subgraph $H$ of a graph $G$ is called spanning, if any vertex of $G$ is not isolated in $H$, while it is called maximum $k$-edge-colorable, if $H$ is $k$-edge-colorable and contains as man...