The following pages link to (Q4770411):
Displaying 50 items.
- Polynomial algorithms for the maximum stable set problem on particular classes of \(P_{5}\)-free graphs (Q290201) (← links)
- On the computational complexity of the virtual network embedding problem (Q325446) (← links)
- Tent and a subclass of \(P_{5}\)-free graphs (Q327628) (← links)
- Maximum weight independent sets in classes related to claw-free graphs (Q344862) (← 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)
- The cluster deletion problem for cographs (Q394219) (← links)
- Finding clubs in graph classes (Q400518) (← links)
- Boolean functions with a simple certificate for CNF complexity (Q412324) (← links)
- A matrix approach to graph maximum stable set and coloring problems with application to multi-agent systems (Q445938) (← links)
- Polynomial-time algorithms for weighted efficient domination problems in AT-free graphs and dually chordal graphs (Q477653) (← links)
- Complexity properties of complementary prisms (Q511681) (← links)
- A polynomial Turing-kernel for weighted independent set in bull-free graphs (Q521799) (← links)
- Some new hereditary classes where graph coloring remains NP-hard (Q556851) (← links)
- \(K_{1,3}\)-free and \(W_4\)-free graphs (Q673353) (← links)
- Maximum regular induced subgraphs in \(2P_3\)-free graphs (Q690473) (← links)
- Maximal cliques in \(\{P_{2} \cup P_{3},C_{4}\}\)-free graphs (Q712269) (← links)
- Maximum weight independent sets in hole- and dart-free graphs (Q714022) (← links)
- Combinatorial optimization with 2-joins (Q765197) (← links)
- Parameterized complexity of independent set in H-free graphs (Q786045) (← links)
- The conjunctive complexity of quadratic Boolean functions (Q808253) (← links)
- \((p,k)\)-coloring problems in line graphs (Q817821) (← links)
- Computing weighted subset transversals in \(H\)-free graphs (Q832863) (← links)
- On independent vertex sets in subclasses of apple-free graphs (Q848838) (← links)
- New applications of clique separator decomposition for the maximum weight stable set problem (Q868954) (← links)
- Trees with maximum number of maximal matchings (Q878628) (← links)
- Weighted independent sets in a subclass of \(P_6\)-free graphs (Q906493) (← links)
- On short paths interdiction problems: Total and node-wise limited interdiction (Q929289) (← links)
- Efficient robust algorithms for the maximum weight stable set problem in chair-free graph classes (Q1029074) (← links)
- Hardness of edge-modification problems (Q1034612) (← links)
- Algorithms for minimum covering by cliques and maximum clique in claw- free perfect graphs (Q1158444) (← links)
- Computing independent sets in graphs with large girth (Q1183338) (← links)
- Covering the cliques of a graph with vertices (Q1201260) (← links)
- Clustering bipartite and chordal graphs: Complexity, sequential and parallel algorithms (Q1283779) (← links)
- Stable sets in certain \(P_6\)-free graphs (Q1304476) (← links)
- Claw-free graphs---a survey (Q1356695) (← links)
- A nice class for the vertex packing problem (Q1363736) (← links)
- An augmenting graph approach to the stable set problem in \(P_{5}\)-free graphs (Q1414237) (← links)
- On easy and hard hereditary classes of graphs with respect to the independent set problem (Q1414579) (← links)
- \(P_{5}\)-free augmenting graphs and the maximum stable set problem (Q1414587) (← links)
- Stable sets in two subclasses of banner-free graphs (Q1414588) (← links)
- Minimum connected transversals in graphs: new hardness results and tractable cases using the price of connectivity (Q1680547) (← links)
- Improved FPT algorithms for weighted independent set in bull-free graphs (Q1685998) (← links)
- Maximum weight independent sets for (\(P_7\),triangle)-free graphs in polynomial time (Q1693130) (← links)
- Maximum weight independent set for \(\ell\)claw-free graphs in polynomial time (Q1701093) (← links)
- Stable sets in \(\{\mathrm{ISK4,wheel}\}\)-free graphs (Q1709574) (← links)
- Sum-perfect graphs (Q1735702) (← links)
- Independent feedback vertex set for \(P_5\)-free graphs (Q1739097) (← links)
- On two extensions of equimatchable graphs (Q1751251) (← links)
- Contraction and deletion blockers for perfect graphs and \(H\)-free graphs (Q1784743) (← links)
