Nonseparating <i>K</i><sub>4</sub>‐subdivisions in graphs of minimum degree at least 4 (Q4553735)
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 6969502
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Nonseparating <i>K</i><sub>4</sub>‐subdivisions in graphs of minimum degree at least 4 |
scientific article; zbMATH DE number 6969502 |
Statements
Nonseparating <i>K</i><sub>4</sub>‐subdivisions in graphs of minimum degree at least 4 (English)
0 references
31 October 2018
0 references
complete graph
0 references
decomposition
0 references
minimum degree
0 references
structure theorem
0 references
subdivision
0 references
0.9232531
0 references
0.90992886
0 references
0.9005852
0 references
0.89020216
0 references
0.8856271
0 references
0.88226795
0 references
0.8789031
0 references
