Pages that link to "Item:Q2443421"

The following pages link to A simple and fast heuristic algorithm for edge-coloring of graphs (Q2443421):

Displaying 3 items.

• Measures of edge-uncolorability of cubic graphs (Q668025) (← links)
• Some results on the structure of multipoles in the study of snarks (Q2260618) (← links)
• ON 4-EDGE COLORING OF CUBIC GRAPHS CONTAINING “SMALL” NON-PLANAR SUBGRAPHS (Q4639461) (← links)