On the number of edge-colourings of regular bipartite graphs (Q1166536): Difference between revisions
From MaRDI portal
Set profile property. |
ReferenceBot (talk | contribs) Changed an Item |
||
| Property / cites work | |||
| Property / cites work: A lower bound for the permanent of a doubly stochastic matrix / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q3897156 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q4184837 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Nonisomorphic Steiner triple systems / rank | |||
Normal rank | |||
Latest revision as of 16:15, 13 June 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | On the number of edge-colourings of regular bipartite graphs |
scientific article |
Statements
On the number of edge-colourings of regular bipartite graphs (English)
0 references
1982
0 references
perfect matchings
0 references
edge-colouring
0 references
