Upper bounds on the number of perfect matchings and directed 2-factors in graphs with given number of vertices and edges (Q482134): Difference between revisions
From MaRDI portal
Created a new Item |
Changed an Item |
||
| Property / Mathematics Subject Classification ID | |||
| Property / Mathematics Subject Classification ID: 05C70 / rank | |||
Normal rank | |||
| Property / zbMATH DE Number | |||
| Property / zbMATH DE Number: 6381903 / rank | |||
Normal rank | |||
Revision as of 19:33, 30 June 2023
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Upper bounds on the number of perfect matchings and directed 2-factors in graphs with given number of vertices and edges |
scientific article |
Statements
Upper bounds on the number of perfect matchings and directed 2-factors in graphs with given number of vertices and edges (English)
0 references
19 December 2014
0 references
