Pages that link to "Item:Q810533"
From MaRDI portal
The following pages link to Clique-transversal sets of line graphs and complements of line graphs (Q810533):
Displayed 43 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)
- A linear-time algorithm for clique-coloring problem in circular-arc graphs (Q512872) (← links)
- Claw-free cubic graphs with clique-transversal number half of their order (Q533447) (← links)
- Clique colourings of geometric graphs (Q668027) (← links)
- Clique-coloring of \(K_{3,3}\)-minor free graphs (Q826557) (← links)
- Structural parameterizations of clique coloring (Q832512) (← links)
- Subgraph transversal of graphs (Q844218) (← links)
- Perfect graphs of arbitrarily large clique-chromatic number (Q896010) (← links)
- Bounds on the clique-transversal number of regular graphs (Q943436) (← links)
- Covering all cliques of a graph (Q1174130) (← links)
- Covering the cliques of a graph with vertices (Q1201260) (← 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 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)
- Algorithmic aspects of clique-transversal and clique-independent sets (Q1971220) (← links)
- Lower bounds on the clique-chromatic numbers of some distance graphs (Q2043671) (← links)
- On the complexity of local-equitable coloring of graphs (Q2077396) (← links)
- New bounds on clique-chromatic numbers of Johnson graphs (Q2192124) (← links)
- The geodesic-transversal problem (Q2246468) (← links)
- A linear-time algorithm for clique-coloring planar graphs (Q2294308) (← links)
- The clique-perfectness and clique-coloring of outer-planar graphs (Q2331588) (← links)
- Hitting all maximal independent sets of a bipartite graph (Q2354017) (← links)
- The algorithmic complexity of the minus clique-transversal problem (Q2383654) (← links)
- Coloring the cliques of line graphs (Q2401798) (← 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-coloring claw-free graphs (Q2631088) (← links)
- Perfect Graphs with No Balanced Skew-Partition are 2-Clique-Colorable (Q2800540) (← links)
- Signed clique-transversal functions in graphs (Q3056375) (← links)
- The signed maximum-clique transversal number of regular graphs (Q4903571) (← links)
- (Q5089217) (← links)
- Clique-transversal number of graphs whose clique-graphs are trees (Q5320228) (← links)
- (Q5866981) (← links)
- Tight asymptotics of clique‐chromatic numbers of dense random graphs (Q6074590) (← links)
- The jump of the clique chromatic number of random graphs (Q6076219) (← links)