On minimal prime extensions of a four-vertex graph in a prime graph
From MaRDI portal
Publication:704276
DOI10.1016/J.DISC.2004.06.019zbMATH Open1056.05111OpenAlexW2058537654MaRDI QIDQ704276FDOQ704276
Authors: Andreas Brandstädt, Chính T. Hoàng, Jean-Marie Vanherpe 
Publication date: 13 January 2005
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.disc.2004.06.019
Recommendations
- Minimal separators in extended \(P_4\)-laden graphs
- On minimal prime graphs and posets
- scientific article; zbMATH DE number 7008862
- scientific article; zbMATH DE number 1839533
- Some 4-total prime cordial labeling of graphs
- Four problems on graphs with excluded minors
- 4-prime cordiality of some cycle related graphs
- Minimal primitive extensions of oriented graphs
- scientific article; zbMATH DE number 3985275
- Minimally 4-edge\(^ \#\)-connected graphs
Extensions of a four-vertex subgraph in a prime graphModular decompositionModules in graphsPrime graphs
Cites Work
- Extension of hereditary classes with substitutions
- Title not available (Why is that?)
- On maximal independent sets of vertices in claw-free graphs
- On diameters and radii of bridged graphs
- On the structure and stability number of \(P_{5}\)- and co-chair-free graphs
- (\(P_{5}\), diamond)-free graphs revisited: Structure and linear time optimization.
- Stability number of bull- and chair-free graphs revisited
- Some classes of perfectly orderable graphs
- A REVISION OF MINTY'S ALGORITHM FOR FINDING A MAXIMUM WEIGHT STABLE SET OF A CLAW-FREE GRAPH
- GEM- AND CO-GEM-FREE GRAPHS HAVE BOUNDED CLIQUE-WIDTH
- Structure and stability number of chair-, co-P- and gem-free graphs revisited
- Maximum Weight Stable Set on graphs without claw and co-claw (and similar graph classes) can be solved in linear time.
- Title not available (Why is that?)
- Efficient robust algorithms for the maximum weight stable set problem in chair-free graph classes
- On the closure of triangle-free graphs under substitution
Cited In (10)
- Title not available (Why is that?)
- 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
- A polynomial algorithm to find an independent set of maximum weight in a fork-free graph
- Substitution-closed pattern classes
- All minimal prime extensions of hereditary classes of graphs
- Prime vertex-minors of a prime graph
- Triangle-free graphs which are minimal for some nonstable 4-vertex subset
- Counting weighted independent sets beyond the permanent
- A finiteness theorem for primal extensions
This page was built for publication: On minimal prime extensions of a four-vertex graph in a prime graph
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q704276)
