Pages that link to "Item:Q1971220"

The following pages link to Algorithmic aspects of clique-transversal and clique-independent sets (Q1971220):

Displaying 44 items.

• The clique-transversal set problem in \(\{\mathrm{claw},K_4\}\)-free planar graphs (Q344543) (← links)
• Weighted maximum-clique transversal sets of graphs (Q410660) (← links)
• The clique-transversal set problem in claw-free graphs with degree at most 4 (Q477680) (← links)
• Clique-perfectness of claw-free planar graphs (Q503649) (← links)
• NP-hardness of the recognition of coordinated graphs (Q839773) (← links)
• Algorithms for finding clique-transversals of graphs (Q940841) (← links)
• Variations of \(Y\)-dominating functions on graphs (Q941347) (← links)
• Bounds on the clique-transversal number of regular graphs (Q943436) (← links)
• Signed and minus clique-transversal functions on graphs (Q976135) (← links)
• The \(\langle t \rangle \)-property of some classes of graphs (Q998518) (← links)
• Partial characterizations of coordinated graphs: Line graphs and complements of forests (Q1014303) (← links)
• Partial characterizations of clique-perfect graphs II: Diamond-free and Helly circular-arc graphs (Q1025541) (← links)
• Approximating weighted neighborhood independent sets (Q1679903) (← links)
• Approximation algorithms for clique-transversal sets and clique-independent sets in cubic graphs (Q1944214) (← links)
• Labelled packing functions in graphs (Q2011027) (← links)
• Complete-subgraph-transversal-sets problem on bounded treewidth graphs (Q2045031) (← links)
• Neighborhood covering and independence on \(P_4\)-tidy graphs and tree-cographs (Q2178334) (← links)
• On some graph classes related to perfect graphs: a survey (Q2184662) (← links)
• The geodesic-transversal problem (Q2246468) (← links)
• The clique-perfectness and clique-coloring of outer-planar graphs (Q2331588) (← links)
• Approximation algorithms for clique transversals on some graph classes (Q2346555) (← links)
• Hitting all maximal independent sets of a bipartite graph (Q2354017) (← links)
• The algorithmic complexity of the minus clique-transversal problem (Q2383654) (← links)
• Variations of maximum-clique transversal sets on graphs (Q2430591) (← links)
• Balanced matrices (Q2433704) (← links)
• Clique-transversal sets and clique-coloring in planar graphs (Q2441644) (← links)
• Partial characterizations of clique-perfect graphs I: Subclasses of claw-free graphs (Q2482103) (← links)
• Distance-hereditary graphs are clique-perfect (Q2489948) (← links)
• Algorithms for clique-independent sets on subclasses of circular-arc graphs (Q2500526) (← links)
• On balanced graphs (Q2583124) (← links)
• Clique-perfectness and balancedness of some graph classes (Q2931952) (← links)
• Signed clique-transversal functions in graphs (Q3056375) (← links)
• Minimally Unbalanced Diamond-Free Graphs and Dyck-Paths (Q3195131) (← links)
• Characterization and recognition of Helly circular-arc clique-perfect graphs (Q3439325) (← links)
• Clique-transversal number of graphs whose clique-graphs are trees (Q5320228) (← links)
• Inapproximability of $H$-Transversal/Packing (Q5348212) (← links)
• (Q5708496) (← links)
• Clique-perfectness of complements of line graphs (Q5891101) (← links)
• Partial characterizations of clique-perfect and coordinated graphs: superclasses of triangle-free graphs (Q5900083) (← links)
• Partial characterizations of clique-perfect and coordinated graphs: superclasses of triangle-free graphs (Q5900860) (← links)
• Connected vertex cover for \((sP_1+P_5)\)-free graphs (Q5919305) (← links)
• Clique-perfectness of complements of line graphs (Q5919747) (← links)
• Bounding the mim‐width of hereditary graph classes (Q6056798) (← links)
• Bounding the Mim-Width of Hereditary Graph Classes. (Q6089650) (← links)