4-factors in 2-connected star-free graphs (Q1045021): Difference between revisions
From MaRDI portal
Set profile property. |
ReferenceBot (talk | contribs) Changed an Item |
||
| (One intermediate revision by one other user not shown) | |||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/j.disc.2009.06.005 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2012280985 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: The existence of a 2-factor in K1, n-free graphs with large connectivity and large edge-connectivity / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: A degree condition for the existence of regular factors inK1,n-free graphs / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: The Factors of Graphs / rank | |||
Normal rank | |||
Latest revision as of 07:52, 2 July 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | 4-factors in 2-connected star-free graphs |
scientific article |
Statements
4-factors in 2-connected star-free graphs (English)
0 references
15 December 2009
0 references
4-factor
0 references
star-free
0 references
minimum degree
0 references
