Mock Threshold Graphs
Combinatorics
2021-06-16 v2
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.
Keywords
Cite
@article{arxiv.1602.06622,
title = {Mock Threshold Graphs},
author = {Richard Behr and Vaidy Sivaraman and Thomas Zaslavsky},
journal= {arXiv preprint arXiv:1602.06622},
year = {2021}
}
Comments
26 pp., 10 figures. V2: 36 pp., 10 figures (improved), added contractibility & remarks