The following pages link to (Q4093489):
Displaying 43 items.
- Structure of squares and efficient domination in graph classes (Q338382) (← links)
- A sufficient condition to extend polynomial results for the maximum independent set problem (Q344869) (← links)
- On atomic structure of \(P_5\)-free subclasses and maximum weight independent set problem (Q385962) (← links)
- Approximation algorithms for intersection graphs (Q476425) (← links)
- Polynomial-time algorithms for weighted efficient domination problems in AT-free graphs and dually chordal graphs (Q477653) (← links)
- Maximum weight independent sets in hole- and dart-free graphs (Q714022) (← links)
- On distance-3 matchings and induced matchings (Q716178) (← links)
- Graphs without large apples and the maximum weight independent set problem (Q742580) (← links)
- Grundy dominating sequences on \(X\)-join product (Q777371) (← links)
- Packing \(r\)-cliques in weighted chordal graphs (Q817141) (← links)
- On algorithms for (\(P_5\), gem)-free graphs (Q817767) (← links)
- Weighted efficient domination in two subclasses of \(P_6\)-free graphs (Q908292) (← links)
- Approximating maximum weight \(K\)-colorable subgraphs in chordal graphs (Q976121) (← links)
- Some remarks on \(\lambda _{p,q}\)-connectedness (Q998437) (← links)
- Weighted coloring on planar, bipartite and split graphs: Complexity and approximation (Q1028481) (← links)
- Decomposition by clique separators (Q1062072) (← links)
- Packing and covering a tree by subtrees (Q1101129) (← links)
- Maximal chordal subgraphs (Q1115455) (← links)
- A decomposition strategy for the vertex cover problem (Q1123907) (← links)
- Independent domination in chordal graphs (Q1169487) (← links)
- New clique and independent set algorithms for circle graphs (Q1186158) (← links)
- On a class of balanced hypergraphs (Q1252358) (← links)
- Induced matchings (Q1262877) (← links)
- The struction algorithm for the maximum stable set problem revisited (Q1332429) (← links)
- Maximum independent set and maximum clique algorithms for overlap graphs (Q1408815) (← links)
- An algorithm for source location in directed graphs (Q1779694) (← links)
- Hypergraphs with cyclomatic number zero, triangulated graphs, and an inequality (Q1836675) (← links)
- On the \(\Delta \)-interval and the \(\Delta \)-convexity numbers of graphs and graph products (Q2161271) (← links)
- Complexity and approximation results for the connected vertex cover problem in graphs and hypergraphs (Q2266936) (← links)
- Inductive \(k\)-independent graphs and \(c\)-colorable subgraphs in scheduling: a review (Q2327955) (← links)
- A \textit{branch} \& \textit{price} algorithm for the minimum cost clique cover problem in max-point tolerance graphs (Q2423295) (← links)
- Stable sets of maximum weight in (\(P_{7}\), banner)-free graphs (Q2463465) (← links)
- On clique separators, nearly chordal graphs, and the Maximum Weight Stable Set Problem (Q2465646) (← links)
- The path partition problem and related problems in bipartite graphs (Q2465958) (← links)
- Perspectives on \(A\)-homotopy theory and its applications (Q2566275) (← links)
- (Q4691867) (← links)
- Treewidth versus Clique Number. I. Graph Classes with a Forbidden Structure (Q5013568) (← links)
- Computing maximum independent set on outerstring graphs and their relatives (Q5918655) (← links)
- Incremental optimization of independent sets under the reconfiguration framework (Q5918743) (← links)
- On efficient domination for some classes of \(H\)-free chordal graphs (Q5918841) (← links)
- On efficient domination for some classes of \(H\)-free chordal graphs (Q5920175) (← links)
- Stackelberg packing games (Q5925607) (← links)
- A polytime preprocess algorithm for the maximum independent set problem (Q6151535) (← links)
