Every 2-connected \(\{\text{claw}, Z_2\}\)-free graph with minimum degree at least 4 contains two CISTs (Q6648248)
From MaRDI portal
| This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Every 2-connected \(\{\text{claw}, Z_2\}\)-free graph with minimum degree at least 4 contains two CISTs |
scientific article; zbMATH DE number 7953864
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Every 2-connected \(\{\text{claw}, Z_2\}\)-free graph with minimum degree at least 4 contains two CISTs |
scientific article; zbMATH DE number 7953864 |
Statements
Every 2-connected \(\{\text{claw}, Z_2\}\)-free graph with minimum degree at least 4 contains two CISTs (English)
0 references
4 December 2024
0 references
claw-free graphs
0 references
two CISTs
0 references
eligible vertex
0 references
Ryjáček's closure
0 references
0 references
0 references
0 references