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
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1017/s0963548302005102 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2099014744 / rank | |||
Normal rank | |||
Latest revision as of 08:46, 30 July 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
