Tight binding number bound for \(P_{\geq 3}\)-factor uniform graphs (Q2234788): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/j.ipl.2021.106162 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W3182225709 / rank | |||
Normal rank | |||
Revision as of 01:29, 20 March 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
