Covering the cliques of a graph with vertices
From MaRDI portal
(Redirected from Publication:1201260)
Recommendations
Cites work
- scientific article; zbMATH DE number 3445275 (Why is no real title available?)
- scientific article; zbMATH DE number 3043302 (Why is no real title available?)
- A note on Ramsey numbers
- Chains, antichains, and fibres
- Clique-transversal sets of line graphs and complements of line graphs
- Covering all cliques of a graph
- Graph Theory and Probability. II
- Improved lower bounds on k‐independence
Cited in
(53)- The \((a, b)\)-monochromatic transversal game on clique-hypergraphs of powers of cycles
- Poset Ramsey number \(R(P,Q_n)\). II: \(\mathrm{N}\)-shaped poset
- Bounded clique cover of some sparse graphs
- On some graph classes related to perfect graphs: a survey
- Bounds on the clique-transversal number of regular graphs
- Covering all cliques of a graph
- The \(\langle t \rangle \)-property of some classes of graphs
- Clique-transversal sets and clique-coloring in planar graphs
- Algorithmic aspects of the generalized clique-transversal problem on chordal graphs
- On the triangle clique cover and \(K_t\) clique cover problems
- Complete-subgraph-transversal-sets problem on bounded treewidth graphs
- scientific article; zbMATH DE number 68359 (Why is no real title available?)
- The clique-transversal set problem in claw-free graphs with degree at most 4
- The clique-transversal set problem in \(\{\mathrm{claw},K_4\}\)-free planar graphs
- Fibres of width 3 ordered sets
- The signed maximum-clique transversal number of regular graphs
- Upper Clique Transversals in Graphs
- Covering and independence in triangle structures
- The algorithmic complexity of the minus clique-transversal problem
- Graphs with no induced \(C_ 4\) and \(2K_ 2\)
- Inapproximability of \(H\)-transversal/packing
- Clique covers of \(H\)-free graphs
- Approximation algorithms for clique transversals on some graph classes
- Covering the edges of a random graph by cliques
- Algorithms for finding clique-transversals of graphs
- scientific article; zbMATH DE number 1286502 (Why is no real title available?)
- Weighted maximum-clique transversal sets of graphs
- Clique-transversal sets of line graphs and complements of line graphs
- scientific article; zbMATH DE number 68550 (Why is no real title available?)
- Clique-perfectness and balancedness of some graph classes
- Clique-perfectness of complements of line graphs
- Clique Covering of Graphs IV. Algorithms
- Clique colourings of geometric graphs
- How many cliques can a clique cover cover?
- Clique-transversal number of graphs whose clique-graphs are trees
- Distance-hereditary graphs are clique-perfect
- On covering all cliques of a chordal graph
- Hitting all maximal independent sets of a bipartite graph
- On cliques and bicliques
- On ordered sets without 2-colourings
- Variations of maximum-clique transversal sets on graphs
- Subgraph transversal of graphs
- On upper bounds for the independent transversal domination number
- Approximation algorithms for clique-transversal sets and clique-independent sets in cubic graphs
- Coloring clique-hypergraphs of graphs with no subdivision of \(K_5\)
- scientific article; zbMATH DE number 4134090 (Why is no real title available?)
- Signed clique-transversal functions in graphs
- Claw-free cubic graphs with clique-transversal number half of their order
- On the clique-transversal number of chordal graphs
- The clique-transversal number of a \(\{K_{1, 3}, K_4 \}\)-free 4-regular graph
- On the clique-transversal number in \({(\mathrm{claw},K_4)}\)-free 4-regular graphs
- Assignment-minimum clique coverings
- Solving the clique cover problem on (bull, \(C_4\))-free graphs
This page was built for publication: Covering the cliques of a graph with vertices
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1201260)
