| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 8903006 | Discrete Mathematics | 2018 | 10 Pages |
Abstract
Let G be a 3-connected claw-free and hourglass-free graph of order n. We show that
Related Topics
Physical Sciences and Engineering
Mathematics
Discrete Mathematics and Combinatorics
Authors
ZdenÄk RyjáÄek, Petr Vrána, Liming Xiong,