Clique r-Domination and Clique r-Packing Problems on Dually Chordal Graphs

DOI10.1137/S0895480194267853zbMath0869.05048OpenAlexW2044652744MaRDI QIDQ3128208

Andreas Brandstädt, Victor Chepoi, Feodor F. Dragan

Publication date: 20 May 1997

Published in: SIAM Journal on Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1137/s0895480194267853

zbMATH Keywords

chordal graphsdominationtree structuresclique packing

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Hypergraphs (05C65) Graph theory (including graph drawing) in computer science (68R10) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Related Items (18)

Detour trees ⋮ Minimally Unbalanced Diamond-Free Graphs and Dyck-Paths ⋮ Clique-perfectness and balancedness of some graph classes ⋮ Neighborhood covering and independence on \(P_4\)-tidy graphs and tree-cographs ⋮ On some graph classes related to perfect graphs: a survey ⋮ Homogeneously orderable graphs ⋮ Inapproximability of $H$-Transversal/Packing ⋮ Weighted maximum-clique transversal sets of graphs ⋮ Variations of maximum-clique transversal sets on graphs ⋮ Algorithms for finding clique-transversals of graphs ⋮ Clique-perfectness of claw-free planar graphs ⋮ Partial characterizations of clique-perfect graphs I: Subclasses of claw-free graphs ⋮ Distance-hereditary graphs are clique-perfect ⋮ Signed and minus clique-transversal functions on graphs ⋮ Clique-perfectness of complements of line graphs ⋮ Clique-perfectness of complements of line graphs ⋮ Partial characterizations of clique-perfect graphs II: Diamond-free and Helly circular-arc graphs ⋮ The clique-perfectness and clique-coloring of outer-planar graphs

This page was built for publication: Clique r-Domination and Clique r-Packing Problems on Dually Chordal Graphs