On the perfect graph conjecture
From MaRDI portal
Publication:1248633
DOI10.1016/S0012-365X(76)80008-8zbMath0383.05018OpenAlexW1968161962WikidataQ56430112 ScholiaQ56430112MaRDI QIDQ1248633
Publication date: 1977
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0012-365x(76)80008-8
Related Items
New classes of perfect graphs, Alternating orientation and alternating colouration of perfect graphs, On a conjecture of Meyniel, Slender graphs, Motivations and history of some of my conjectures, Recognizing max-flow min-cut path matrices, A new property of critical imperfect graphs and some consequences, Locally perfect graphs, A fast algorithm for coloring Meyniel graphs, Forbidden graphs for degree and neighbourhood conditions, Star-cutsets and perfect graphs, Meyniel weakly triangulated graphs. II: A theorem of Dirac, On essential components and critical sets of a graph, Slim graphs, Some properties of minimal imperfect graphs, Graphical properties related to minimal imperfection, Covering, Packing and Generalized Perfection, Structure and algorithms for (cap, even hole)-free graphs, 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, A class of perfect graphs containing \(P_{6}\), On domination elimination orderings and domination graphs, Classes of perfect graphs, Graphs vertex-partitionable into strong cliques, Square-free perfect graphs., Meyniel graphs are strongly perfect, Meyniel weakly triangulated graphs. I: Co-perfect orderability, On slim graphs, even pairs, and star-cutsets, Compositions for perfect graphs, Skeletal graphs - a new class of perfect graphs, Ramsey-type theorems, Coloring Artemis graphs, On the linear extension complexity of stable set polytopes for perfect graphs, Detecting strong cliques, On kernels in i-triangulated graphs, A notion of cross-perfect bipartite graphs, On minimal imperfect graphs without induced \(P_5\), HOLES AND DOMINOES IN MEYNIEL GRAPHS, The maximum clique problem, On \(m\)-centers in \(P_ t\)-free graphs
Cites Work
