Variations of maximum-clique transversal sets on graphs
From MaRDI portal
Publication:2430591
DOI10.1007/s10479-009-0673-6zbMath1235.90175OpenAlexW2046263886MaRDI QIDQ2430591
Publication date: 8 April 2011
Published in: Annals of Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10479-009-0673-6
distance-hereditary graphsdually chordal graphshereditary clique-Helly graphsclique transversal functionmaximum-clique perfectminus maximum-clique transversalsigned maximum-clique transversal
Related Items
Weighted maximum-clique transversal sets of graphs, Computing a minimum outer-connected dominating set for the class of chordal graphs, The signed maximum-clique transversal number of regular graphs
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Maximum \(h\)-colourable subgraph problem in balanced graphs
- Clique-transversal sets of line graphs and complements of line graphs
- Algorithms for finding clique-transversals of graphs
- Variations of \(Y\)-dominating functions on graphs
- Partial characterizations of clique-perfect graphs II: Diamond-free and Helly circular-arc graphs
- Characterizations of strongly chordal graphs
- Neighborhood perfect graphs
- Distance-hereditary graphs
- Covering the cliques of a graph with vertices
- A theory of alternating paths and blossoms for proving correctness of the \(O(\sqrt{V}E)\) general graph maximum matching algorithm
- Transversal partitioning in balanced hypergraphs
- On the clique-transversal number of chordal graphs
- On clique-transversals and clique-independent sets
- On covering all cliques of a chordal graph
- Algorithmic aspects of the generalized clique-transversal problem on chordal graphs
- Algorithmic aspects of clique-transversal and clique-independent sets
- Doubly lexical ordering of dense 0--1 matrices
- The algorithmic complexity of the minus clique-transversal problem
- Partial characterizations of clique-perfect graphs I: Subclasses of claw-free graphs
- Distance-hereditary graphs are clique-perfect
- Algorithms for clique-independent sets on subclasses of circular-arc graphs
- Triangulated graphs and the elimination process
- On balanced graphs
- Clique r-Domination and Clique r-Packing Problems on Dually Chordal Graphs
- Three Partition Refinement Algorithms
- Dually Chordal Graphs
- Graph Classes: A Survey
- Faster scaling algorithms for general graph matching problems
- Doubly chordal graphs, steiner trees, and connected domination
- Algorithmic Aspects of Neighborhood Numbers
- Algorithm Theory - SWAT 2004
- Algorithms for Minimum Coloring, Maximum Clique, Minimum Covering by Cliques, and Maximum Independent Set of a Chordal Graph
