Pages that link to "Item:Q5285934"

The following pages link to Algorithmic Aspects of Neighborhood Numbers (Q5285934):

Displaying 31 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)
• 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)
• Partial characterizations of clique-perfect graphs II: Diamond-free and Helly circular-arc graphs (Q1025541) (← links)
• The algorithmic use of hypertree structure and maximum neighbourhood orderings (Q1383368) (← links)
• Approximating weighted neighborhood independent sets (Q1679903) (← links)
• A clique tree algorithm for partitioning a chordal graph into transitive subgraphs (Q1894513) (← links)
• Algorithmic aspects of the generalized clique-transversal problem on chordal graphs (Q1917287) (← links)
• Approximation algorithms for clique-transversal sets and clique-independent sets in cubic graphs (Q1944214) (← links)
• Algorithmic aspects of clique-transversal and clique-independent sets (Q1971220) (← 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 clique-perfectness and clique-coloring of outer-planar graphs (Q2331588) (← links)
• Approximation algorithms for clique transversals on some graph classes (Q2346555) (← links)
• Variations of maximum-clique transversal sets on graphs (Q2430591) (← 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)
• Clique-perfectness and balancedness of some graph classes (Q2931952) (← links)
• An Optimal Algorithm to Solve 2-Neighbourhood Covering Problem on Interval Graphs (Q4780532) (← links)
• Minimum r-neighborhood covering set of permutation graphs (Q5025160) (← links)
• Clique-transversal number of graphs whose clique-graphs are trees (Q5320228) (← links)
• The<i>k</i>-neighbourhood-covering problem on interval graphs (Q5747730) (← links)
• Clique-perfectness of complements of line graphs (Q5919747) (← links)