Pages that link to "Item:Q3128208"
From MaRDI portal
The following pages link to Clique r-Domination and Clique r-Packing Problems on Dually Chordal Graphs (Q3128208):
Displaying 18 items.
- Detour trees (Q277622) (← links)
- Weighted maximum-clique transversal sets of graphs (Q410660) (← links)
- Clique-perfectness of claw-free planar graphs (Q503649) (← links)
- Algorithms for finding clique-transversals of graphs (Q940841) (← 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)
- Homogeneously orderable graphs (Q1392023) (← 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)
- Variations of maximum-clique transversal sets on graphs (Q2430591) (← links)
- Partial characterizations of clique-perfect graphs I: Subclasses of claw-free graphs (Q2482103) (← links)
- Distance-hereditary graphs are clique-perfect (Q2489948) (← links)
- Clique-perfectness and balancedness of some graph classes (Q2931952) (← links)
- Minimally Unbalanced Diamond-Free Graphs and Dyck-Paths (Q3195131) (← links)
- Inapproximability of $H$-Transversal/Packing (Q5348212) (← links)
- Clique-perfectness of complements of line graphs (Q5891101) (← links)
- Clique-perfectness of complements of line graphs (Q5919747) (← links)
