scientific article
From MaRDI portal
Publication:3676177
zbMath0563.05049MaRDI QIDQ3676177
No author found.
Publication date: 1984
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Graph theory (including graph drawing) in computer science (68R10) Structural characterization of families of graphs (05C75)
Related Items (36)
\(k\)-NLC graphs and polynomial algorithms ⋮ Recognizing well covered graphs of families with special \(P _{4}\)-components ⋮ Inapproximability of the lid-chromatic number ⋮ Some observations on maximum weight stable sets in certain \(P_{5}\)-free graphs ⋮ On semi-\(P_ 4\)-sparse graphs ⋮ Unnamed Item ⋮ New applications of clique separator decomposition for the maximum weight stable set problem ⋮ Characterizations and algorithmic applications of chordal graph embeddings ⋮ On atomic structure of \(P_5\)-free subclasses and maximum weight independent set problem ⋮ On the \(b\)-coloring of \(P_{4}\)-tidy graphs ⋮ Characterisations and Linear-Time Recognition of Probe Cographs ⋮ Cograph generation with linear delay ⋮ On variations of \(P_{4}\)-sparse graphs ⋮ Stability number of bull- and chair-free graphs revisited ⋮ On the structure and stability number of \(P_{5}\)- and co-chair-free graphs ⋮ Unnamed Item ⋮ Maximization coloring problems on graphs with few \(P_4\) ⋮ (\(P_{5}\), diamond)-free graphs revisited: Structure and linear time optimization. ⋮ An algorithm for finding homogeneous pairs ⋮ On the complexity of 4-coloring graphs without long induced paths ⋮ How to use the minimal separators of a graph for its chordal triangulation ⋮ An O(\(n\)) time algorithm for maximum matching on cographs ⋮ Recent developments on graphs of bounded clique-width ⋮ On the structure of (\(P_{5}\),\,gem)-free graphs ⋮ Chordal co-gem-free and (\(P_{5}\),\,gem)-free graphs have bounded clique-width ⋮ On characterizations for subclasses of directed co-graphs ⋮ Three-coloring and list three-coloring of graphs without induced paths on seven vertices ⋮ Structure and stability number of chair-, co-P- and gem-free graphs revisited ⋮ Efficient robust algorithms for the maximum weight stable set problem in chair-free graph classes ⋮ On the b-coloring of cographs and \(P_{4}\)-sparse graphs ⋮ Maximum Weight Stable Set on graphs without claw and co-claw (and similar graph classes) can be solved in linear time. ⋮ A linear time algorithm for the maximum matching problem on cographs ⋮ Clustering and domination in perfect graphs ⋮ Bibliography on domination in graphs and some basic definitions of domination parameters ⋮ A dichotomy for the dominating set problem for classes defined by small forbidden induced subgraphs ⋮ On algorithms for (\(P_5\), gem)-free graphs
This page was built for publication:
