On disjoint matchings in cubic graphs: maximum 2-edge-colorable and maximum 3-edge-colorable subgraphs
From MaRDI portal
Publication:2449123
DOI10.1016/j.dam.2014.03.001zbMath1288.05079OpenAlexW61806522MaRDI QIDQ2449123
Gagik N. Vardanyan, Davit Aslanyan, Samvel S. Petrosyan, Vahan V. Mkrtchyan
Publication date: 6 May 2014
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.dam.2014.03.001
Related Items (6)
Characterization of saturated graphs related to pairs of disjoint matchings ⋮ Pairs of disjoint matchings and related classes of graphs ⋮ On maximum \(k\)-edge-colorable subgraphs of bipartite graphs ⋮ Measures of edge-uncolorability of cubic graphs ⋮ Maximal \(k\)-edge-colorable subgraphs, Vizing's theorem, and Tuza's conjecture ⋮ On strongly spanning k-edge-colorable subgraphs
Cites Work
- Unnamed Item
- On disjoint matchings in cubic graphs
- On edge-disjoint pairs of matchings
- Characterization of a class of graphs related to pairs of disjoint matchings
- Approximating the maximum 3-edge-colorable subgraph problem
- Matching theory
- The edge chromatic difference sequence of a cubic graph
- Measurements of edge-uncolorability
- Parsimonious edge coloring
- A note on minimal matching covered graphs
- On trees with a maximum proper partial 0-1 coloring containing a maximum matching
- On the Core of a Graph†
This page was built for publication: On disjoint matchings in cubic graphs: maximum 2-edge-colorable and maximum 3-edge-colorable subgraphs