Cubic bridgeless graphs have more than a linear number of perfect matchings (Q2851496): Difference between revisions
From MaRDI portal
Created claim: Wikidata QID (P12): Q57601457, #quickstatements; #temporary_batch_1711234560214 |
ReferenceBot (talk | contribs) Changed an Item |
||
Property / cites work | |||
Property / cites work: Perfect matchings in planar cubic graphs / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Brick decompositions and the matching rank of graphs / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Matching theory / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Rank of maximum matchings in a graph / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Counting 1-factors in regular bipartite graphs / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4184837 / rank | |||
Normal rank |
Latest revision as of 23:23, 6 July 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Cubic bridgeless graphs have more than a linear number of perfect matchings |
scientific article |
Statements
Cubic bridgeless graphs have more than a linear number of perfect matchings (English)
0 references
10 October 2013
0 references
perfect matchings
0 references
cubic graphs
0 references