The upper bound of the number of cycles in a 2-factor of a line graph (Q3445503): Difference between revisions
From MaRDI portal
Created a new Item |
Set OpenAlex properties. |
||
| (4 intermediate revisions by 3 users not shown) | |||
| Property / author | |||
| Property / author: Sheng Gui Zhang / rank | |||
| Property / author | |||
| Property / author: Sheng Gui Zhang / rank | |||
Normal rank | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1002/jgt.20220 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W4254224703 / rank | |||
Normal rank | |||
| links / mardi / name | links / mardi / name | ||
Latest revision as of 18:34, 19 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | The upper bound of the number of cycles in a 2-factor of a line graph |
scientific article |
Statements
The upper bound of the number of cycles in a 2-factor of a line graph (English)
0 references
11 June 2007
0 references
line graph
0 references
2-factor
0 references
number of components
0 references
