Graphs That Do Not Contain a Cycle with a Node That Has at Least Two Neighbors on It (Q4915184)
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: Graphs That Do Not Contain a Cycle with a Node That Has at Least Two Neighbors on It |
scientific article; zbMATH DE number 6152396
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Graphs That Do Not Contain a Cycle with a Node That Has at Least Two Neighbors on It |
scientific article; zbMATH DE number 6152396 |
Statements
Graphs That Do Not Contain a Cycle with a Node That Has at Least Two Neighbors on It (English)
0 references
9 April 2013
0 references
connectivity
0 references
wheels
0 references
induced subgraph
0 references
propeller
0 references
