On disjoint matchings in cubic graphs: maximum 2-edge-colorable and maximum 3-edge-colorable subgraphs (Q2449123)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | On disjoint matchings in cubic graphs: maximum 2-edge-colorable and maximum 3-edge-colorable subgraphs |
scientific article |
Statements
On disjoint matchings in cubic graphs: maximum 2-edge-colorable and maximum 3-edge-colorable subgraphs (English)
0 references
6 May 2014
0 references
edge-coloring
0 references
cubic graph
0 references
maximum 2-edge-colorable subgraph
0 references
maximum 3-edge-colorable subgraph
0 references
