Algorithmic Aspects of the Generalized Clique-transversal Problem on Chordal Graphs
نویسندگان
چکیده
Suppose G=( V,E) is a graph in which each maximal clique Ci is associated with an integer ri, where 0 < ri < ICi 1. The generalized clique transversal problem is to determine the minimum cardinality of a subset D of V such that ID n Cij >ri for every maximal clique Ci of G. The problem includes the clique-transversal problem, the i, 1 clique-cover problem, and for perfect graphs, the maximum q-colorable subgraph problems as special cases. This paper gives complexity results for the problem on subclasses of chordal graphs, e.g., strongly chordal graphs, k-trees, split graphs, and undirected path graphs.
منابع مشابه
Parallel algorithms for generalized clique transversal problems
The K `-clique transversal problem is to locate a minimum collection of cliques of size ` in a graph G such that every maximal clique of sizè in G contains at least one member of the collection. We give an NC algorithm to solve this problem on strongly chordal graphs.
متن کاملClique r-Domination and Clique r-Packing Problems on Dually Chordal Graphs
Let C be a family of cliques of a graph G = (V,E). Suppose that each clique C of C is associated with an integer r(C), where r(C) ≥ 0. A vertex v r-dominates a clique C of G if d(v, x) ≤ r(C) for all x ∈ C, where d(v, x) is the standard graph distance. A subset D ⊆ V is a clique r-dominating set of G if for every clique C ∈ C there is a vertex u ∈ D which r-dominates C. A clique r-packing set i...
متن کاملOn Chordal-k-Generalized Split Graphs
A graph G is a chordal-k-generalized split graph if G is chordal and there is a clique Q in G such that every connected component in G[V \ Q] has at most k vertices. Thus, chordal-1-generalized split graphs are exactly the split graphs. We characterize chordal-k-generalized split graphs by forbidden induced subgraphs. Moreover, we characterize a very special case of chordal-2-generalized split ...
متن کاملComplexity of Generalized Colourings of Chordal Graphs
The generalized graph colouring problem (GCOL) for a fixed integer k, and fixed classes of graphs P1, . . . ,Pk (usually describing some common graph properties), is to decide, for a given graph G, whether the vertex set of G can be partitioned into sets V1, . . . , Vk such that, for each i, the induced subgraph of G on Vi belongs to Pi. It can be seen that GCOL generalizes many natural colouri...
متن کاملClique cycle transversals in distance-hereditary graphs
A cycle-transversal of a graph G is a subset T ⊆ V (G) such that T ∩V (C) 6= ∅ for every cycle C of G. A clique cycle-transversal, or cct for short, is a cycle-transversal which is a clique. Recognizing graphs which admit a cct can be done in polynomial time; however, no structural characterization of such graphs is known. We characterize distancehereditary graphs admitting a cct in terms of fo...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Discrete Applied Mathematics
دوره 66 شماره
صفحات -
تاریخ انتشار 1996