Pages that link to "Item:Q2568333"
From MaRDI portal
The following pages link to Partitioning cographs into cliques and stable sets (Q2568333):
Displaying 18 items.
- Partitioning extended \(P_4\)-laden graphs into cliques and stable sets (Q456142) (← links)
- Characterization and recognition of \(P_{4}\)-sparse graphs partitionable into \(k\) independent sets and \(\ell \) cliques (Q629355) (← links)
- \((p,k)\)-coloring problems in line graphs (Q817821) (← links)
- A tutorial on the use of graph coloring for some problems in robotics (Q948648) (← links)
- Partitioning graphs into complete and empty graphs (Q1045126) (← links)
- The \((k, \ell)\) partitioned probe problem: NP-complete versus polynomial dichotomy (Q1686050) (← links)
- Advances on defective parameters in graphs (Q1751109) (← links)
- Partitions and well-coveredness: the graph sandwich problem (Q2111912) (← links)
- On the probe problem for \((r, \ell)\)-well-coveredness: algorithms and complexity (Q2172604) (← links)
- \((k,l)\)-colourings and Ferrers diagram representations of cographs (Q2225413) (← links)
- Stable-\(\Pi\) partitions of graphs (Q2255049) (← links)
- Partitioning a graph into disjoint cliques and a triangle-free graph (Q2352776) (← links)
- Fixed-parameter algorithms for the cocoloring problem (Q2440099) (← links)
- On the probe problem for \((r,\ell )\)-well-coveredness (Q2695302) (← links)
- A Brooks‐Type Theorem for the Bichromatic Number (Q3466343) (← links)
- Graph Classes and Forbidden Patterns on Three Vertices (Q5855535) (← links)
- Polar cographs (Q5899394) (← links)
- Polar cographs (Q5900347) (← links)
