All minimal prime extensions of hereditary classes of graphs

DOI10.1016/j.tcs.2006.10.024zbMath1110.68100OpenAlexW2039910360MaRDI QIDQ868943

Vassilis Giakoumakis, Stephan Olariu

Publication date: 26 February 2007

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://digitalcommons.odu.edu/cgi/viewcontent.cgi?article=1103&context=computerscience_fac_pubs

zbMATH Keywords

graph theorymodular decompositiongraph decompositions

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Related Items (3)

Substitution-closed pattern classes ⋮ Deciding whether there are infinitely many prime graphs with forbidden induced subgraphs ⋮ The set of prime extensions of a graph: the finite and the infinite case

Cites Work

• Unnamed Item
• On minimal prime extensions of a four-vertex graph in a prime graph
• On the closure of triangle-free graphs under substitution
• A nice class for the vertex packing problem
• On the closure of graphs under substitution
• Progress on perfect graphs
• Basic perfect graphs and their extensions
• Extension of hereditary classes with substitutions
• A characterization of domination reducible graphs
• On the vertex packing problem
• A finiteness theorem for primal extensions
• Normal hypergraphs and the perfect graph conjecture
• Some classes of perfectly orderable graphs
• Graph Classes: A Survey

This page was built for publication: All minimal prime extensions of hereditary classes of graphs