Connected cubic graphs with the maximum number of perfect matchings (Q6057662): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
ReferenceBot (talk | contribs) Changed an Item |
||
Property / cites work | |||
Property / cites work: On the maximum number of cycles in a planar graph / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: The maximum number of perfect matchings in graphs with a given degree sequence / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4044717 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3922712 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Exponentially many perfect matchings in cubic graphs / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: An exact upper bound to the maximum number of perfect matchings in cubic pseudographs / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: On graphs with many cycles / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3395507 / rank | |||
Normal rank |
Revision as of 01:55, 3 August 2024
scientific article; zbMATH DE number 7746134
Language | Label | Description | Also known as |
---|---|---|---|
English | Connected cubic graphs with the maximum number of perfect matchings |
scientific article; zbMATH DE number 7746134 |
Statements
Connected cubic graphs with the maximum number of perfect matchings (English)
0 references
5 October 2023
0 references
2-factor
0 references
cubic graph
0 references
extremal graph theory
0 references
perfect matching
0 references