On some properties of \(0\)-degeneracy graphs (Q1312774): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 13:02, 31 January 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | On some properties of \(0\)-degeneracy graphs |
scientific article |
Statements
On some properties of \(0\)-degeneracy graphs (English)
0 references
30 October 1994
0 references
A definition of 0-degeneracy graphs is given and structural properties of such graphs are discussed. Problems of the number of vertices and of the connectivity of 0-degeneracy graphs are studied in eight lemmas. Lemma 1 and Lemma 8 raise several interesting open questions. The general ideas are illustrated by five drawings.
0 references
linear programming
0 references
complexity
0 references
degeneracy graphs
0 references
connectivity
0 references
