Constructing Trees in Graphs whose Complement has no <b><i>K</i></b><sub>2,<b><i>s</i></b></sub> (Q3146982): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 21:54, 3 February 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Constructing Trees in Graphs whose Complement has no <b><i>K</i></b><sub>2,<b><i>s</i></b></sub> |
scientific article |
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
