Article ID Journal Published Year Pages File Type
5776911 Discrete Mathematics 2017 8 Pages PDF
Abstract
We prove that if M is a maximal k-edge-colorable subgraph of a multigraph G and if F={v∈V(G):dM(v)≤k−μ(v)}, then dF(v)≤dM(v) for all v∈V(G) with dM(v)
Keywords
Related Topics
Physical Sciences and Engineering Mathematics Discrete Mathematics and Combinatorics
Authors
,