A characterization of well‐covered graphs that contain neither 4‐ nor 5‐cycles (Q4312248): Difference between revisions
From MaRDI portal
Created a new Item |
Set OpenAlex properties. |
||
| (4 intermediate revisions by 3 users not shown) | |||
| Property / author | |||
| Property / author: Bert L. Hartnell / rank | |||
| Property / author | |||
| Property / author: Q186124 / rank | |||
| Property / author | |||
| Property / author: Bert L. Hartnell / rank | |||
Normal rank | |||
| Property / author | |||
| Property / author: Richard J. Nowakowski / rank | |||
Normal rank | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1002/jgt.3190180707 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2125478135 / rank | |||
Normal rank | |||
| links / mardi / name | links / mardi / name | ||
Latest revision as of 20:52, 19 March 2024
scientific article; zbMATH DE number 682532
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A characterization of well‐covered graphs that contain neither 4‐ nor 5‐cycles |
scientific article; zbMATH DE number 682532 |
Statements
A characterization of well‐covered graphs that contain neither 4‐ nor 5‐cycles (English)
0 references
4 April 1995
0 references
characterization
0 references
independent set
0 references
well-covered graph
0 references
cycles
0 references
extendable vertex
0 references
polynomial time
0 references
