scientific article
From MaRDI portal
Publication:3222886
zbMath0558.05055MaRDI QIDQ3222886
Publication date: 1984
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Graph theory (including graph drawing) in computer science (68R10) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Structural characterization of families of graphs (05C75)
Related Items
Polyhedral consequences of the amalgam operation ⋮ Alternating orientation and alternating colouration of perfect graphs ⋮ On a conjecture of Meyniel ⋮ Recognizing bull-free perfect graphs ⋮ Paw-free graphs ⋮ Recognizing claw-free perfect graphs ⋮ Star-cutsets and perfect graphs ⋮ Some properties of minimal imperfect graphs ⋮ Graphs of separability at most 2 ⋮ Strong cliques in vertex‐transitive graphs ⋮ Coloring vertices of a graph or finding a Meyniel obstruction ⋮ Graphs without odd holes, parachutes or proper wheels: A generalization of Meyniel graphs and of line graphs of bipartite graphs ⋮ Erdős-Hajnal for cap-free graphs ⋮ Articulation sets in linear perfect matrices. I: Forbidden configurations and star cutsets ⋮ On slim graphs, even pairs, and star-cutsets ⋮ The anti-join composition and polyhedra ⋮ Compositions for perfect graphs ⋮ Recognition of quasi-Meyniel graphs ⋮ On kernels in i-triangulated graphs ⋮ The strong perfect graph conjecture: 40 years of attempts, and its resolution ⋮ Minimal antichains in well-founded quasi-orders with an application to tournaments ⋮ A decomposition for a class of \((P_ 5,\overline{P}_ 5)\)-free graphs ⋮ The maximum clique problem ⋮ Decomposition of perfect graphs
