scientific article; zbMATH DE number 3887730
From MaRDI portal
Publication:3222223
[For the entire collection see Zbl 0546.00006.] For disjoint simple graphs H and K, taking a vertex u in H and a vertex v in K, a composition of H and K with respect to u and v is obtained from H-u and K-v by joining each vertex in \(N_ H(u)\) to every vertex in \(N_ K(v)\). It is proved that if H and K are perfect then so is the resulting graph.
Recommendations
Cited in
(23)- Constructions for normal graphs and some consequences
- The strong perfect graph conjecture: 40 years of attempts, and its resolution
- Decomposition of perfect graphs
- Star-cutsets and perfect graphs
- Articulation sets in linear perfect matrices. I: Forbidden configurations and star cutsets
- Stable set bonding in perfect graphs and parity graphs
- Polyhedral consequences of the amalgam operation
- Quasi-star-cutsets and some consequences
- Exact profile values of some graph compositions
- The graph sandwich problem for 1-join composition is NP-complete
- Bichromatic \(P_{4}\)-composition schemes for perfect orderability
- An exact cutting plane algorithm to solve the selective graph coloring problem in perfect graphs
- Compositions for perfect graphs
- 2-clique-bond of stable set polyhedra
- Perfectly orderable P₄ composition
- scientific article; zbMATH DE number 4148129 (Why is no real title available?)
- On hereditary properties of composition graphs
- Lambda composition
- scientific article; zbMATH DE number 1503636 (Why is no real title available?)
- Word-representability of graphs with respect to split recomposition
- The anti-join composition and polyhedra
- A class of h-perfect graphs
- Solving some NP-complete problems using split decomposition
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3222223)