On strongly spanning k-edge-colorable subgraphs
A subgraph \(H\) of a multigraph \(G\) is called strongly spanning, if any vertex of \(G\) is not isolated in \(H\). \(H\) is called maximum \(k\)-edge-colorable, if \(H\) is proper \(k\)-edge-colorable and has the largest size. We introduce a graph-parameter \(sp(G)\), that coincides with the small...
| Main Authors: | , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
AGH Univeristy of Science and Technology Press
2017-01-01
|
| Series: | Opuscula Mathematica |
| Subjects: | |
| Online Access: | http://www.opuscula.agh.edu.pl/vol37/3/art/opuscula_math_3720.pdf |