Pages that link to "Item:Q2489948"

The following pages link to Distance-hereditary graphs are clique-perfect (Q2489948):

Displaying 24 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)
• Bounds on the clique-transversal number of regular graphs (Q943436) (← links)
• Signed and minus clique-transversal functions on graphs (Q976135) (← links)
• Partial characterizations of clique-perfect graphs II: Diamond-free and Helly circular-arc graphs (Q1025541) (← links)
• Approximation algorithms for clique-transversal sets and clique-independent sets in cubic graphs (Q1944214) (← links)
• Complete-subgraph-transversal-sets problem on bounded treewidth graphs (Q2045031) (← links)
• On some graph classes related to perfect graphs: a survey (Q2184662) (← links)
• The clique-perfectness and clique-coloring of outer-planar graphs (Q2331588) (← links)
• Approximation algorithms for clique transversals on some graph classes (Q2346555) (← links)
• The algorithmic complexity of the minus clique-transversal problem (Q2383654) (← links)
• Variations of maximum-clique transversal sets on graphs (Q2430591) (← links)
• Clique-transversal sets and clique-coloring in planar graphs (Q2441644) (← links)
• Clique-perfectness and balancedness of some graph classes (Q2931952) (← links)
• On the complexity of variations of mixed domination on graphs^† (Q2958268) (← links)
• Signed clique-transversal functions in graphs (Q3056375) (← links)
• Minimally Unbalanced Diamond-Free Graphs and Dyck-Paths (Q3195131) (← links)
• Clique-transversal number of graphs whose clique-graphs are trees (Q5320228) (← links)
• Clique-perfectness of complements of line graphs (Q5891101) (← links)
• Partial characterizations of clique-perfect and coordinated graphs: superclasses of triangle-free graphs (Q5900860) (← links)
• Clique-perfectness of complements of line graphs (Q5919747) (← links)
• Unique response Roman domination: complexity and algorithms (Q6088304) (← links)