Pages that link to "Item:Q4099664"

The following pages link to Colouring the Edges of a Multigraph so that Each Vertex has at Most <i>j</i> , or at Least <i>j</i> , Edges of Each Colour on it (Q4099664):

Displayed 13 items.

• Edge covering coloring of nearly bipartite graphs (Q854458) ‎ (← links)
• The chromatic index of multigraphs that are nearly full (Q910411) ‎ (← links)
• A special \(f\)-edge cover-coloring of multigraphs (Q949274) ‎ (← links)
• Regular and canonical colorings (Q1135863) ‎ (← links)
• Obstructions for regular colorings (Q1160139) ‎ (← links)
• Canonical edge-colourings of locally finite graphs (Q1168978) ‎ (← links)
• On the number of 1-factorizations of the complete graph (Q1212021) ‎ (← links)
• Multigraphs with quasiweak odd cycles (Q1245852) ‎ (← links)
• Further remarks on partitioning the edges of a graph (Q1245982) ‎ (← links)
• Partitioning the edges of a graph (Q1259608) ‎ (← links)
• A generalization of chromatic index (Q1313837) ‎ (← links)
• A sufficient condition for equitable edge-colourings of simple graphs (Q1322183) ‎ (← links)
• The method of coloring in graphs and its application (Q2429917) ‎ (← links)