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