Pages that link to "Item:Q2449123"
From MaRDI portal
The following pages link to On disjoint matchings in cubic graphs: maximum 2-edge-colorable and maximum 3-edge-colorable subgraphs (Q2449123):
Displaying 11 items.
- Maximal \(k\)-edge-colorable subgraphs, Vizing's theorem, and Tuza's conjecture (Q526243) (← links)
- Measures of edge-uncolorability of cubic graphs (Q668025) (← links)
- On disjoint matchings in cubic graphs (Q968438) (← links)
- Approximating the maximum 3-edge-colorable subgraph problem (Q1043590) (← links)
- On maximum \(k\)-edge-colorable subgraphs of bipartite graphs (Q1730239) (← links)
- Characterization of saturated graphs related to pairs of disjoint matchings (Q2135642) (← links)
- How many disjoint 2-edge paths must a cubic graph have? (Q4446888) (← links)
- On strongly spanning k-edge-colorable subgraphs (Q5737974) (← links)
- Pairs of disjoint matchings and related classes of graphs (Q6117063) (← links)
- Graphs, disjoint matchings and some inequalities (Q6615584) (← links)
- The maximum 2-edge-colorable subgraph problem and its fixed-parameter tractability (Q6616225) (← links)