The following pages link to Graph edge coloring: a survey (Q1733850):
Displaying 16 items.
- Parameterized complexity of \textsc{maximum edge colorable subgraph} (Q2019513) (← links)
- Parameterized complexity of maximum edge colorable subgraph (Q2088595) (← links)
- Switching 3-edge-colorings of cubic graphs (Q2144509) (← links)
- Subcubic planar graphs of girth 7 are class I (Q2144599) (← links)
- Complexity and approximation results on the shared transportation problem (Q2149862) (← links)
- On the average degree of edge chromatic critical graphs. II. (Q2200934) (← links)
- On the average degree of edge chromatic critical graphs (Q2222052) (← links)
- Fractional matchings, component-factors and edge-chromatic critical graphs (Q2657106) (← links)
- Hamiltonian cycles and 1-factors in 5-regular graphs (Q2668019) (← links)
- Facial rainbow edge-coloring of simple 3-connected plane graphs (Q3298111) (← links)
- Properties of Large 2-Crossing-Critical Graphs (Q5084710) (← links)
- A brief history of edge-colorings – with personal reminiscences (Q5862696) (← links)
- On the maximum number of edges in chordal graphs of bounded degree and matching number (Q5970781) (← links)
- Double Vizing fans in critical class two graphs (Q6047636) (← links)
- The average degree of edge chromatic critical graphs with maximum degree seven (Q6074595) (← links)
- On the chromatic edge stability index of graphs (Q6116405) (← links)
