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

DOI10.1137/S0895480194267853zbMath0869.05048MaRDI 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 graphs; domination; tree structures; clique packing

Mathematics Subject Classification ID

68Q25: Analysis of algorithms and problem complexity

05C65: Hypergraphs

68R10: Graph theory (including graph drawing) in computer science

05C70: Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.)

Related Items

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