Tight binding number bound for \(P_{\geq 3}\)-factor uniform graphs (Q2234788): Difference between revisions
From MaRDI portal
Latest revision as of 20:16, 26 July 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Tight binding number bound for \(P_{\geq 3}\)-factor uniform graphs |
scientific article |
Statements
Tight binding number bound for \(P_{\geq 3}\)-factor uniform graphs (English)
0 references
19 October 2021
0 references
path factor
0 references
binding number
0 references
\(P_{\geq k}\)-factor uniform graph
0 references
combinatorial problems
0 references
0 references
0 references