On the number of edge-colourings of regular bipartite graphs (Q1166536): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(4 intermediate revisions by 3 users not shown)
Property / author
 
Property / author: Alexander Schrijver / rank
Normal rank
 
Property / author
 
Property / author: Alexander Schrijver / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
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
links / mardi / namelinks / mardi / name
 

Latest revision as of 15: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

    Identifiers