Pages that link to "Item:Q1201260"
From MaRDI portal
The following pages link to Covering the cliques of a graph with vertices (Q1201260):
Displayed 22 items.
- Weighted maximum-clique transversal sets of graphs (Q410660) (← links)
- Claw-free cubic graphs with clique-transversal number half of their order (Q533447) (← 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)
- 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)
- The algorithmic complexity of the minus clique-transversal problem (Q2383654) (← links)
- Variations of maximum-clique transversal sets on graphs (Q2430591) (← links)
- Distance-hereditary graphs are clique-perfect (Q2489948) (← 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)