On the closure of graphs under substitution

DOI10.1016/S0012-365X(96)00358-5zbMath0893.05019OpenAlexW2038139957MaRDI QIDQ1377871

Vassilis Giakoumakis

Publication date: 20 July 1998

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0012-365x(96)00358-5

zbMATH Keywords

perfect graphsmoduleclosuresubstitution-composition

Mathematics Subject Classification ID

Enumeration in graph theory (05C30) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Coloring of graphs and hypergraphs (05C15) Graph theory (05C99)

Related Items

All minimal prime extensions of hereditary classes of graphs ⋮ Substitution-closed pattern classes ⋮ Simple permutations and algebraic generating functions ⋮ \(\mathcal{P}\)-apex graphs ⋮ Forbidden graphs for classes of split-like graphs ⋮ On prime inductive classes of graphs ⋮ Deciding whether there are infinitely many prime graphs with forbidden induced subgraphs ⋮ A finiteness theorem for primal extensions ⋮ The set of prime extensions of a graph: the finite and the infinite case

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• On the closure of triangle-free graphs under substitution
• Graph derivatives
• New classes of Berge perfect graphs
• On a class of square-free graphs
• The history of the perfect graphs
• Normal hypergraphs and the perfect graph conjecture
• On a Class of P ₅ -Free Graphs
• Four classes of perfectly orderable graphs
• Decomposition of Directed Graphs
• An upper bound for the chromatic number of a graph and its application to timetabling problems
• On the strong perfect graph conjecture