Finding 1-Factors in Bipartite Regular Graphs and Edge-Coloring Bipartite Graphs (Q4785684)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Finding 1-Factors in Bipartite Regular Graphs and Edge-Coloring Bipartite Graphs |
scientific article; zbMATH DE number 1848499
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Finding 1-Factors in Bipartite Regular Graphs and Edge-Coloring Bipartite Graphs |
scientific article; zbMATH DE number 1848499 |
Statements
Finding 1-Factors in Bipartite Regular Graphs and Edge-Coloring Bipartite Graphs (English)
0 references
5 January 2003
0 references
time-tabling
0 references
edge-coloring
0 references
perfect matching
0 references
regular bipartite graphs
0 references
0.8937098383903503
0 references
0.881107747554779
0 references
0.881107747554779
0 references
0.8745190501213074
0 references
0.8729435801506042
0 references
