Covering the cliques of a graph with vertices
From MaRDI portal
Publication:1201260
DOI10.1016/0012-365X(92)90681-5zbMath0766.05063OpenAlexW2086357278WikidataQ105471961 ScholiaQ105471961MaRDI QIDQ1201260
Tibor Gallai, Paul Erdős, Zsolt Tuza
Publication date: 17 January 1993
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0012-365x(92)90681-5
Extremal problems in graph theory (05C35) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Graph algorithms (graph-theoretic aspects) (05C85)
Related Items
Fibres of width 3 ordered sets, Subgraph transversal of graphs, The algorithmic complexity of the minus clique-transversal problem, The clique-transversal set problem in \(\{\mathrm{claw},K_4\}\)-free planar graphs, On covering all cliques of a chordal graph, Clique-transversal number of graphs whose clique-graphs are trees, Clique-perfectness and balancedness of some graph classes, Covering and independence in triangle structures, Algorithmic aspects of the generalized clique-transversal problem on chordal graphs, On some graph classes related to perfect graphs: a survey, Inapproximability of $H$-Transversal/Packing, Weighted maximum-clique transversal sets of graphs, On upper bounds for the independent transversal domination number, Approximation algorithms for clique-transversal sets and clique-independent sets in cubic graphs, Variations of maximum-clique transversal sets on graphs, Clique-transversal sets and clique-coloring in planar graphs, Covering all cliques of a graph, On the clique-transversal number in \({(\mathrm{claw},K_4)}\)-free 4-regular graphs, The clique-transversal set problem in claw-free graphs with degree at most 4, Clique colourings of geometric graphs, Algorithms for finding clique-transversals of graphs, Bounds on the clique-transversal number of regular graphs, The signed maximum-clique transversal number of regular graphs, Coloring clique-hypergraphs of graphs with no subdivision of \(K_5\), Claw-free cubic graphs with clique-transversal number half of their order, Distance-hereditary graphs are clique-perfect, Signed clique-transversal functions in graphs, The \(\langle t \rangle \)-property of some classes of graphs, Graphs with no induced \(C_ 4\) and \(2K_ 2\), Complete-subgraph-transversal-sets problem on bounded treewidth graphs, Clique-perfectness of complements of line graphs, On the clique-transversal number of chordal graphs, On ordered sets without 2-colourings, The clique-transversal number of a \(\{K_{1, 3}, K_4 \}\)-free 4-regular graph, Approximation algorithms for clique transversals on some graph classes, Clique-transversal sets of line graphs and complements of line graphs, Hitting all maximal independent sets of a bipartite graph
Cites Work
