Minimum number of edges guaranteeing the existence of a \(K_{1, t}\)-factor in a graph (Q2689114): 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.1007/s00373-023-02616-0 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W4322009197 / rank | |||
Normal rank | |||
Revision as of 22:12, 19 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Minimum number of edges guaranteeing the existence of a \(K_{1, t}\)-factor in a graph |
scientific article |
Statements
Minimum number of edges guaranteeing the existence of a \(K_{1, t}\)-factor in a graph (English)
0 references
9 March 2023
0 references
\(K_{1, t}\)-factor
0 references
number of edges
0 references
minimum degree
0 references
