scientific article; zbMATH DE number 3513839
From MaRDI portal
Publication:4093489
zbMath0328.05141MaRDI QIDQ4093489
Publication date: 1976
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Trees (05C05) Extremal problems in graph theory (05C35) Graph theory (05C99) Combinatorial aspects of packing and covering (05B40)
Related Items
The struction algorithm for the maximum stable set problem revisited ⋮ Packing and covering a tree by subtrees ⋮ Unnamed Item ⋮ Structure of squares and efficient domination in graph classes ⋮ A sufficient condition to extend polynomial results for the maximum independent set problem ⋮ On the \(\Delta \)-interval and the \(\Delta \)-convexity numbers of graphs and graph products ⋮ Maximal chordal subgraphs ⋮ A decomposition strategy for the vertex cover problem ⋮ On atomic structure of \(P_5\)-free subclasses and maximum weight independent set problem ⋮ A \textit{branch} \& \textit{price} algorithm for the minimum cost clique cover problem in max-point tolerance graphs ⋮ A polytime preprocess algorithm for the maximum independent set problem ⋮ Maximum independent set and maximum clique algorithms for overlap graphs ⋮ Weighted efficient domination in two subclasses of \(P_6\)-free graphs ⋮ Independent domination in chordal graphs ⋮ Approximation algorithms for intersection graphs ⋮ Polynomial-time algorithms for weighted efficient domination problems in AT-free graphs and dually chordal graphs ⋮ New clique and independent set algorithms for circle graphs ⋮ Stable sets of maximum weight in (\(P_{7}\), banner)-free graphs ⋮ On clique separators, nearly chordal graphs, and the Maximum Weight Stable Set Problem ⋮ The path partition problem and related problems in bipartite graphs ⋮ Approximating maximum weight \(K\)-colorable subgraphs in chordal graphs ⋮ Complexity and approximation results for the connected vertex cover problem in graphs and hypergraphs ⋮ Maximum weight independent sets in hole- and dart-free graphs ⋮ On distance-3 matchings and induced matchings ⋮ An algorithm for source location in directed graphs ⋮ Some remarks on \(\lambda _{p,q}\)-connectedness ⋮ On a class of balanced hypergraphs ⋮ Computing maximum independent set on outerstring graphs and their relatives ⋮ Incremental optimization of independent sets under the reconfiguration framework ⋮ On efficient domination for some classes of \(H\)-free chordal graphs ⋮ Graphs without large apples and the maximum weight independent set problem ⋮ On efficient domination for some classes of \(H\)-free chordal graphs ⋮ Induced matchings ⋮ Stackelberg packing games ⋮ Weighted coloring on planar, bipartite and split graphs: Complexity and approximation ⋮ Grundy dominating sequences on \(X\)-join product ⋮ Hypergraphs with cyclomatic number zero, triangulated graphs, and an inequality ⋮ Inductive \(k\)-independent graphs and \(c\)-colorable subgraphs in scheduling: a review ⋮ Perspectives on \(A\)-homotopy theory and its applications ⋮ Treewidth versus Clique Number. I. Graph Classes with a Forbidden Structure ⋮ Decomposition by clique separators ⋮ Packing \(r\)-cliques in weighted chordal graphs ⋮ On algorithms for (\(P_5\), gem)-free graphs
