| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 4650062 | Discrete Mathematics | 2009 | 12 Pages |
Abstract
Suppose that 0<η<10<η<1 is given. We call a graph, GG, on nn vertices an ηη-Chvátal graph if its degree sequence d1≤d2≤⋯≤dnd1≤d2≤⋯≤dn satisfies: for k
Keywords
Related Topics
Physical Sciences and Engineering
Mathematics
Discrete Mathematics and Combinatorics
Authors
Gábor N. Sárközy,