Every 3-connected claw-free graph of diameter at most 3 has a 2-factor with at most two components (Q6936991)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 8086193
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Every 3-connected claw-free graph of diameter at most 3 has a 2-factor with at most two components |
scientific article; zbMATH DE number 8086193 |
Statements
Every 3-connected claw-free graph of diameter at most 3 has a 2-factor with at most two components (English)
0 references
28 August 2025
0 references
claw-free graph
0 references
diameter
0 references
2-factors
0 references
