Pages that link to "Item:Q4198790"

The following pages link to Using euler partitions to edge color bipartite multigraphs (Q4198790):

Displayed 15 items.

• Linear algorithms for edge-coloring trees and unicyclic graphs (Q600259) ‎ (← links)
• A simple algorithm for edge-coloring bipartite multigraphs (Q1007547) ‎ (← links)
• Combinatorial analysis (nonnegative matrices, algorithmic problems) (Q1060220) ‎ (← links)
• An implicit data structure for searching a multikey table in logarithmic time (Q1186547) ‎ (← links)
• A parallel algorithm for edge-coloring of graphs with edge-disjoint cycles (Q1195493) ‎ (← links)
• A parallel algorithm for approximating the minimum cycle cover (Q1207326) ‎ (← links)
• Rearrangeable nonblocking condition for multi-log\(_ 2 N\) multiconnection networks (Q1313749) ‎ (← links)
• The NP-completeness of chromatic index in triangle free graphs with maximum vertex of degree 3 (Q1354146) ‎ (← links)
• A simple matching algorithm for regular bipartite graphs. (Q1853135) ‎ (← links)
• Approximate constrained bipartite edge coloring (Q1887041) ‎ (← links)
• From L. Euler to D. König (Q3398587) ‎ (← links)
• Short Proof of Galvin's Theorem on the List-chromatic Index of a Bipartite Multigraph (Q4883064) ‎ (← links)
• The complexity of arc-colorings for directed hypergraphs (Q5899364) ‎ (← links)
• The complexity of arc-colorings for directed hypergraphs (Q5917590) ‎ (← links)
• Edge coloring of bipartite graphs with constraints (Q5958313) ‎ (← links)