The following pages link to Parsimonious edge coloring (Q1910535):
Displaying 16 items.
- Measures of edge-uncolorability of cubic graphs (Q668025) (← links)
- On disjoint matchings in cubic graphs (Q968438) (← links)
- The edge chromatic difference sequence of a cubic graph (Q1377864) (← links)
- On maximum \(k\)-edge-colorable subgraphs of bipartite graphs (Q1730239) (← links)
- Measurements of edge-uncolorability (Q1827679) (← links)
- Minimum number of palettes in edge colorings (Q2014713) (← links)
- On parsimonious edge-colouring of graphs with maximum degree three (Q2376086) (← links)
- On disjoint matchings in cubic graphs: maximum 2-edge-colorable and maximum 3-edge-colorable subgraphs (Q2449123) (← links)
- Maximum \(\Delta \)-edge-colorable subgraphs of class II graphs (Q2911495) (← links)
- Facial parity edge colouring (Q3225726) (← links)
- Parsimonious edge-coloring on surfaces (Q5009990) (← links)
- Between Proper and Strong Edge-Colorings of Subcubic Graphs (Q5041205) (← links)
- Between proper and strong edge‐colorings of subcubic graphs (Q6046648) (← links)
- Decomposition of class II graphs into two class I graphs (Q6080564) (← links)
- Graphs, disjoint matchings and some inequalities (Q6615584) (← links)
- The maximum 2-edge-colorable subgraph problem and its fixed-parameter tractability (Q6616225) (← links)