The following pages link to Edge-coloring of multigraphs (Q2570119):
Displaying 23 items.
- Complexity of 3-edge-coloring in the class of cubic graphs with a polyhedral embedding in an orientable surface (Q602768) (← links)
- A comparison of two edge-coloring formulations (Q688209) (← links)
- Edge colouring by total labellings (Q960914) (← links)
- Mixed graph edge coloring (Q1043571) (← links)
- A polyhedral approach to edge coloring (Q1180838) (← links)
- Edge coloring nearly bipartite graphs (Q1306362) (← links)
- Complexity classification of the edge coloring problem for a family of graph classes (Q1675533) (← links)
- An application of matching theory of edge-colourings (Q1923520) (← links)
- Vizing's and Shannon's theorems for defective edge colouring (Q2094863) (← links)
- Polynomial time complexity of edge colouring graphs with bounded colour classes (Q2249736) (← links)
- New algorithm for calculating chromatic index of graphs and its applications (Q2338156) (← links)
- Edge-colouring of join graphs (Q2369004) (← links)
- Edge-coloring almost bipartite multigraphs (Q2444912) (← links)
- Multiply balanced edge colorings of multigraphs (Q2897208) (← links)
- Vizing's coloring algorithm and the fan number (Q3055930) (← links)
- Edge-coloring of multigraphs: Recoloring technique (Q3216672) (← links)
- (Q3323976) (← links)
- Approximation of 3-Edge-Coloring of Cubic Graphs (Q3503456) (← links)
- (Q4014299) (← links)
- Edge-Coloring and f-Coloring for Various Classes of Graphs (Q4243441) (← links)
- The edge chromatic number of a directed/mixed multigraph (Q4261182) (← links)
- Experimental and Efficient Algorithms (Q5710064) (← links)
- Bounds for the chromatic index of signed multigraphs (Q6162038) (← links)
