Variations of maximum-clique transversal sets on graphs
From MaRDI portal
Publication:2430591
Recommendations
- Weighted maximum-clique transversal sets of graphs
- scientific article; zbMATH DE number 2044919
- Clique-transversal sets and weak 2-colorings in graphs of small maximum degree
- The clique-transversal set problem in claw-free graphs with degree at most 4
- The bound of clique-transversal numbers in claw-free graphs
Cites work
- A theory of alternating paths and blossoms for proving correctness of the \(O(\sqrt{V}E)\) general graph maximum matching algorithm
- Algorithm Theory - SWAT 2004
- Algorithmic aspects of clique-transversal and clique-independent sets
- Algorithmic Aspects of Neighborhood Numbers
- Algorithmic aspects of the generalized clique-transversal problem on chordal graphs
- Algorithms for clique-independent sets on subclasses of circular-arc graphs
- Algorithms for finding clique-transversals of graphs
- Algorithms for Minimum Coloring, Maximum Clique, Minimum Covering by Cliques, and Maximum Independent Set of a Chordal Graph
- Characterizations of strongly chordal graphs
- Clique r-Domination and Clique r-Packing Problems on Dually Chordal Graphs
- Clique-transversal number in cubic graphs
- Clique-transversal sets of line graphs and complements of line graphs
- Covering the cliques of a graph with vertices
- Distance-hereditary graphs
- Distance-hereditary graphs are clique-perfect
- Doubly chordal graphs, steiner trees, and connected domination
- Doubly lexical ordering of dense 0--1 matrices
- Dually Chordal Graphs
- Faster scaling algorithms for general graph matching problems
- Graph Classes: A Survey
- scientific article; zbMATH DE number 553916 (Why is no real title available?)
- scientific article; zbMATH DE number 2044919 (Why is no real title available?)
- scientific article; zbMATH DE number 3363617 (Why is no real title available?)
- Maximum \(h\)-colourable subgraph problem in balanced graphs
- Neighborhood perfect graphs
- On balanced graphs
- On clique-perfect and K-perfect graphs
- On clique-transversals and clique-independent sets
- On covering all cliques of a chordal graph
- On the clique-transversal number of chordal graphs
- Partial characterizations of clique-perfect graphs I: Subclasses of claw-free graphs
- Partial characterizations of clique-perfect graphs II: Diamond-free and Helly circular-arc graphs
- The algorithmic complexity of the minus clique-transversal problem
- Three Partition Refinement Algorithms
- Transversal partitioning in balanced hypergraphs
- Triangulated graphs and the elimination process
- Variations of \(Y\)-dominating functions on graphs
Cited in
(8)- Algorithmic aspects of the generalized clique-transversal problem on chordal graphs
- Computing a minimum outer-connected dominating set for the class of chordal graphs
- Maximum \(h\)-colourable subgraph problem in balanced graphs
- Clique-Transversal Sets in Cubic Graphs
- Weighted maximum-clique transversal sets of graphs
- scientific article; zbMATH DE number 2044919 (Why is no real title available?)
- Optimal‐size clique transversals in chordal graphs
- The signed maximum-clique transversal number of regular graphs
This page was built for publication: Variations of maximum-clique transversal sets on graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2430591)
