Mock threshold graphs

From MaRDI portal




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.











This page was built for publication: Mock threshold graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1637131)