Constructing Trees in Graphs whose Complement has no <b><i>K</i></b><sub>2,<b><i>s</i></b></sub> (Q3146982)
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 1802527
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Constructing Trees in Graphs whose Complement has no <b><i>K</i></b><sub>2,<b><i>s</i></b></sub> |
scientific article; zbMATH DE number 1802527 |
Statements
Constructing Trees in Graphs whose Complement has no <b><i>K</i></b><sub>2,<b><i>s</i></b></sub> (English)
0 references
3 November 2002
0 references
trees
0 references
subgraphs
0 references
0.96902895
0 references
0.88403875
0 references
0.88043237
0 references
0.88032156
0 references
0.8780271
0 references
0.8716173
0 references
0.86783266
0 references
