Name
Abstract | ||
|---|---|---|
Mock threshold graphs are a simple generalization of threshold graphs that, like threshold graphs, are perfect graphs. Our main theorem is a characterization of mock threshold graphs by forbidden induced subgraphs. Other theorems characterize mock threshold graphs that are claw-free and that are line graphs. We also discuss relations with chordality and well-quasi-ordering as well as algorithmic aspects. |
Year | DOI | Venue |
|---|---|---|
2018 | 10.1016/j.disc.2018.04.023 | Discrete Mathematics |
Keywords | DocType | Volume |
Mock threshold graph,Perfect graph,Forbidden induced subgraph,Claw-free graph,Line graph,Chordal graph | Journal | 341 |
Issue | ISSN | Citations |
8 | 0012-365X | 1 |
PageRank | References | Authors |
0.36 | 0 | 3 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Richard Behr | 1 | 2 | 0.75 |
| Vaidy Sivaraman | 2 | 1 | 0.36 |
| T. Zaslavsky | 3 | 297 | 56.67 |