Algorithmic aspects of the generalized clique-transversal problem on chordal graphs
From MaRDI portal
Publication:1917287
DOI10.1016/0166-218X(95)00048-VzbMATH Open0854.68072MaRDI QIDQ1917287FDOQ1917287
Authors: Maw-Shang Chang, Yi-Hua Chen, Jing-Ho Yan, Gerard Jennhwa Chang 
Publication date: 13 January 1997
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Recommendations
Trees (05C05) Graph algorithms (graph-theoretic aspects) (05C85) Graph theory (including graph drawing) in computer science (68R10) Extremal problems in graph theory (05C35) Coloring of graphs and hypergraphs (05C15)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Covering all cliques of a graph
- Incidence matrices and interval graphs
- Title not available (Why is that?)
- Title not available (Why is that?)
- Doubly lexical ordering of dense 0--1 matrices
- The intersection graphs of subtrees in trees are exactly the chordal graphs
- Representation of a finite graph by a set of intervals on the real line
- Three Partition Refinement Algorithms
- Bibliography on domination in graphs and some basic definitions of domination parameters
- Characterizations of strongly chordal graphs
- Triangulated graphs and the elimination process
- \(K_ i\)-covers. I: Complexity and polytopes
- The maximum k-colorable subgraph problem for chordal graphs
- Generalized vertex covering in interval graphs
- The complexity of generalized clique covering
- Title not available (Why is that?)
- Algorithms for maximumk-colorings andk-coverings of transitive graphs
- Algorithms for Minimum Coloring, Maximum Clique, Minimum Covering by Cliques, and Maximum Independent Set of a Chordal Graph
- Dominating sets for split and bipartite graphs
- A recognition algorithm for the intersection graphs of directed paths in directed trees
- A recognition algorithm for the intersection graphs of paths in trees
- Totally-Balanced and Greedy Matrices
- The k-Domination and k-Stability Problems on Sun-Free Chordal Graphs
- Dominating Sets in Chordal Graphs
- On chain and antichain families of a partially ordered set
- Some partitions associated with a partially ordered set
- Covering the cliques of a graph with vertices
- Algorithmic Aspects of Neighborhood Numbers
- Clique-transversal sets of line graphs and complements of line graphs
- The structure of Sperner k-families
- Edge-Deletion Problems
- The neighbourhood number of a graph
- A Dynamic Programming Approach to the Dominating Set Problem on k-Trees
- Neighborhood perfect graphs
Cited In (23)
- Algorithmic aspects of clique-transversal and clique-independent sets
- Algorithms for maximumk-colorings andk-coverings of transitive graphs
- Optimal‐size clique transversals in chordal graphs
- Weighted maximum-clique transversal sets of graphs
- Signed and minus clique-transversal functions on graphs
- Labelled packing functions in graphs
- A linear-time algorithm for the weighted feedback vertex problem on interval graphs
- A generalization of chordal graphs and the maximum clique problem
- Bounds on the clique-transversal number of regular graphs
- Approximation results for the optimum cost chromatic partition problem
- The geodesic-transversal problem
- Complete-subgraph-transversal-sets problem on bounded treewidth graphs
- The algorithmic complexity of the minus clique-transversal problem
- Variations of maximum-clique transversal sets on graphs
- A clique tree algorithm for partitioning a chordal graph into transitive subgraphs
- Signed clique-transversal functions in graphs
- The clique-transversal set problem in \(\{\mathrm{claw},K_4\}\)-free planar graphs
- Clique-transversal number of graphs whose clique-graphs are trees
- The clique-transversal set problem in claw-free graphs with degree at most 4
- LP Approaches to Improved Approximation for Clique Transversal in Perfect Graphs
- Algorithms for finding clique-transversals of graphs
- Distance-hereditary graphs are clique-perfect
- Variations of \(Y\)-dominating functions on graphs
This page was built for publication: Algorithmic aspects of the generalized clique-transversal problem on chordal graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1917287)
