Pages that link to "Item:Q1201260"
From MaRDI portal
The following pages link to Covering the cliques of a graph with vertices (Q1201260):
Displaying 37 items.
- The clique-transversal set problem in \(\{\mathrm{claw},K_4\}\)-free planar graphs (Q344543) (← links)
- Weighted maximum-clique transversal sets of graphs (Q410660) (← links)
- The clique-transversal set problem in claw-free graphs with degree at most 4 (Q477680) (← links)
- Coloring clique-hypergraphs of graphs with no subdivision of \(K_5\) (Q500982) (← links)
- Claw-free cubic graphs with clique-transversal number half of their order (Q533447) (← links)
- Clique colourings of geometric graphs (Q668027) (← links)
- Clique-transversal sets of line graphs and complements of line graphs (Q810533) (← links)
- Subgraph transversal of graphs (Q844218) (← links)
- Algorithms for finding clique-transversals of graphs (Q940841) (← links)
- Bounds on the clique-transversal number of regular graphs (Q943436) (← links)
- The \(\langle t \rangle \)-property of some classes of graphs (Q998518) (← links)
- Covering all cliques of a graph (Q1174130) (← links)
- On ordered sets without 2-colourings (Q1301737) (← links)
- Fibres of width 3 ordered sets (Q1338130) (← links)
- On the clique-transversal number of chordal graphs (Q1584423) (← links)
- On upper bounds for the independent transversal domination number (Q1693131) (← links)
- Graphs with no induced \(C_ 4\) and \(2K_ 2\) (Q1801686) (← links)
- On covering all cliques of a chordal graph (Q1910588) (← links)
- Covering and independence in triangle structures (Q1916100) (← links)
- Algorithmic aspects of the generalized clique-transversal problem on chordal graphs (Q1917287) (← links)
- Approximation algorithms for clique-transversal sets and clique-independent sets in cubic graphs (Q1944214) (← links)
- Complete-subgraph-transversal-sets problem on bounded treewidth graphs (Q2045031) (← links)
- On some graph classes related to perfect graphs: a survey (Q2184662) (← links)
- The clique-transversal number of a \(\{K_{1, 3}, K_4 \}\)-free 4-regular graph (Q2339429) (← links)
- Approximation algorithms for clique transversals on some graph classes (Q2346555) (← links)
- Hitting all maximal independent sets of a bipartite graph (Q2354017) (← links)
- The algorithmic complexity of the minus clique-transversal problem (Q2383654) (← links)
- Variations of maximum-clique transversal sets on graphs (Q2430591) (← links)
- Clique-transversal sets and clique-coloring in planar graphs (Q2441644) (← links)
- On the clique-transversal number in \({(\mathrm{claw},K_4)}\)-free 4-regular graphs (Q2452398) (← links)
- Distance-hereditary graphs are clique-perfect (Q2489948) (← links)
- Clique-perfectness and balancedness of some graph classes (Q2931952) (← links)
- Signed clique-transversal functions in graphs (Q3056375) (← links)
- The signed maximum-clique transversal number of regular graphs (Q4903571) (← links)
- Clique-transversal number of graphs whose clique-graphs are trees (Q5320228) (← links)
- Inapproximability of $H$-Transversal/Packing (Q5348212) (← links)
- Clique-perfectness of complements of line graphs (Q5919747) (← links)
