The number of 1-factors in 2k-connected graphs (Q1253256): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
ReferenceBot (talk | contribs) Changed an Item |
||
Property / cites work | |||
Property / cites work: Perfect matchings of a graph / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: On the 1-factors of a non-separable graph / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: On the structure of factorizable graphs / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Ecken vom Grad \(n\) in minimalen \(n\)-fach zusammenhängenden Graphen / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: 1-Faktoren von Graphen. (1-factors of graphs) / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: The Factorization of Linear Graphs / rank | |||
Normal rank |
Latest revision as of 00:06, 13 June 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | The number of 1-factors in 2k-connected graphs |
scientific article |
Statements
The number of 1-factors in 2k-connected graphs (English)
0 references
1978
0 references
Number of 1-Factors in a 2k-Connected Graph
0 references