Edge coloring of bipartite graphs with constraints (Q5958313): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
Created claim: Wikidata QID (P12): Q126382619, #quickstatements; #temporary_batch_1718107978296
 
(One intermediate revision by one other user not shown)
Property / cites work
 
Property / cites work: Q3941433 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Edge Coloring Bipartite Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Complexity of Timetable and Multicommodity Flow Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Using euler partitions to edge color bipartite multigraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithms for Edge Coloring Bipartite Graphs and Multigraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: An $n^{5/2} $ Algorithm for Maximum Matchings in Bipartite Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient wavelength routing on directed fiber trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Constrained bipartite edge coloring with applications to wavelength routing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5501821 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4252739 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bipartite Edge Coloring in $O(\Delta m)$ Time / rank
 
Normal rank
Property / Wikidata QID
 
Property / Wikidata QID: Q126382619 / rank
 
Normal rank

Latest revision as of 14:16, 11 June 2024

scientific article; zbMATH DE number 1715314
Language Label Description Also known as
English
Edge coloring of bipartite graphs with constraints
scientific article; zbMATH DE number 1715314

    Statements