Pages that link to "Item:Q5642584"
From MaRDI portal
The following pages link to Decomposition of bipartite multigraphs into matchings (Q5642584):
Displayed 5 items.
- Remarks on the requirement matrix of school timetable problems and regular embeddings of graphs (Q1149373) (← links)
- Kőnig's edge-colouring theorem for all graphs (Q2450735) (← links)
- Optimal partition of a bipartite graph into non-crossing matchings (Q3438979) (← links)
- Some results in chromatic scheduling (Q4052161) (← links)
- Notes on Equitable Partitions into Matching Forests in Mixed Graphs and into $b$-branchings in Digraphs (Q6045402) (← links)