scientific article
From MaRDI portal
Publication:3286847
zbMath0103.16201MaRDI QIDQ3286847
Publication date: 1960
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items (60)
The graph sandwich problem for 1-join composition is NP-complete ⋮ Perfect graphs with no \(P_ 5\) and no \(K_ 5\) ⋮ On dart-free perfectly contractile graphs ⋮ The story of perfectly orderable graphs ⋮ On the structure of certain intersection graphs ⋮ The Maximum Weight Stable Set Problem in ( $$P_6$$ , bull)-Free Graphs ⋮ Fast Skew Partition Recognition ⋮ Even pairs in square-free Berge graphs ⋮ Coloring perfect degenerate graphs ⋮ Motivations and history of some of my conjectures ⋮ Path parity and perfection ⋮ Discs in unbreakable graphs ⋮ A bipartite analogue of Dilworth's theorem ⋮ On weakly diamond-free Berge graphs ⋮ Some properties of minimal imperfect graphs ⋮ An algorithm for coloring some perfect graphs ⋮ Even pairs in claw-free perfect graphs ⋮ Covering, Packing and Generalized Perfection ⋮ Complementation in T-perfect graphs ⋮ Finding a shortest even hole in polynomial time ⋮ LARGE SIGNED SUBSET SUMS ⋮ Perfectly contractile graphs and quadratic toric rings ⋮ Clique separator decomposition of hole-free and diamond-free graphs and algorithmic consequences ⋮ Bounding clique-width via perfect graphs ⋮ Matrix partitions of perfect graphs ⋮ Exact and Parameterized Algorithms for (k, i)-Coloring ⋮ Coloring square-free Berge graphs ⋮ On coloring problems with local constraints ⋮ Some properties of edge intersection graphs of single-bend paths on a grid ⋮ \(k\)-domination and \(k\)-independence in graphs: A survey ⋮ On the structure of bull-free perfect graphs ⋮ Partial characterizations of clique-perfect and coordinated graphs: superclasses of triangle-free graphs ⋮ Counterexamples to three conjectures concerning perfect graphs ⋮ Finding balance: split graphs and related classes ⋮ On slim graphs, even pairs, and star-cutsets ⋮ Transitive orientations in bull-reducible Berge graphs ⋮ Graph transformations preserving the stability number ⋮ Studies on hypergraphs. I: Hyperforests ⋮ Antitwins in partitionable graphs ⋮ Degrees and independent sets of hypergraphs ⋮ Recognition of quasi-Meyniel graphs ⋮ On the dominator coloring in proper interval graphs and block graphs ⋮ Graph transformations preserving the stability number ⋮ Matroidal graphs ⋮ Induced matchings ⋮ On the quasi-locally paw-free graphs ⋮ Coloring Artemis graphs ⋮ On superperfection of edge intersection graphs of paths ⋮ A notion of cross-perfect bipartite graphs ⋮ Unnamed Item ⋮ Brambles and independent packings in chordal graphs ⋮ The strong perfect graph conjecture: 40 years of attempts, and its resolution ⋮ Acyclic digraphs with Gallai-Milgram-Linial property for clique-covers ⋮ On Tucker vertices of graphs ⋮ On the Maximum Weight Independent Set Problem in Graphs without Induced Cycles of Length at Least Five ⋮ A class of perfectly contractile graphs ⋮ On balanced graphs ⋮ The independence number of graphs in terms of degrees ⋮ Quasi-star-cutsets and some consequences ⋮ On the interval chromatic number of proper interval graphs
This page was built for publication:
