Article ID | Journal | Published Year | Pages | File Type |
---|---|---|---|---|
5776911 | Discrete Mathematics | 2017 | 8 Pages |
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
Gregory J. Puleo,