On the closure of triangle-free graphs under substitution

DOI10.1016/0020-0190(90)90143-LMaRDI QIDQ915449zbMATH OpenOpenAlexFDO

Authors Stephan Olariu

Publication date 1990

Published in Information Processing Letters (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0020-0190(90)90143-l

zbMATH Keywords

closureperfect graphspolynomial-time algorithmssubstitution

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Parallel algorithms in computer science (68W10)

Cites work

• Bull-free Berge graphs are perfect
• scientific article; zbMATH DE number 3859178 (Why is no real title available?)
• Incremental modular decomposition
• Normal hypergraphs and the perfect graph conjecture
• Topics on perfect graphs

Cited in

(10)

• On semi-\(P_ 4\)-sparse graphs
• On the closure of graphs under substitution
• Maximum weight independent sets for (\(P_7\), triangle)-free graphs in polynomial time
• Extension of hereditary classes with substitutions
• Maximum weight independent sets for (\(S_{1,2,4}\), triangle)-free graphs in polynomial time
• Independent sets in \((P_4+P_4\),triangle)-free graphs
• A finiteness theorem for primal extensions
• Strong triadic closure in cographs and graphs of low maximum degree
• On minimal prime extensions of a four-vertex graph in a prime graph
• All minimal prime extensions of hereditary classes of graphs

This page was built for publication: On the closure of triangle-free graphs under substitution

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