Pages that link to "Item:Q1827861"
From MaRDI portal
The following pages link to Partitioning chordal graphs into independent sets and cliques (Q1827861):
Displaying 39 items.
- Clique cycle-transversals in distance-hereditary graphs (Q299045) (← links)
- Obstructions to partitions of chordal graphs (Q383740) (← links)
- Partitioning extended \(P_4\)-laden graphs into cliques and stable sets (Q456142) (← links)
- Colouring, constraint satisfaction, and complexity (Q458466) (← links)
- Strict chordal and strict split digraphs (Q516787) (← links)
- Cover-incomparability graphs and chordal graphs (Q602752) (← links)
- Characterization and recognition of \(P_{4}\)-sparse graphs partitionable into \(k\) independent sets and \(\ell \) cliques (Q629355) (← links)
- Packing \(r\)-cliques in weighted chordal graphs (Q817141) (← links)
- List matrix partitions of chordal graphs (Q817772) (← links)
- \((p,k)\)-coloring problems in line graphs (Q817821) (← links)
- Digraph matrix partitions and trigraph homomorphisms (Q860407) (← links)
- Algorithms for \(\mathcal{GA}\mathrm{-}\mathcal H\) reduced graphs (Q891818) (← links)
- Polarity of chordal graphs (Q955313) (← links)
- On split-coloring problems (Q995923) (← links)
- Distance paired-domination problems on subclasses of chordal graphs (Q1034627) (← links)
- A surprising permanence of old motivations (a not-so-rigid story) (Q1045032) (← links)
- Brambles and independent packings in chordal graphs (Q1045070) (← links)
- Partitioning graphs into complete and empty graphs (Q1045126) (← links)
- The \((k, \ell)\) partitioned probe problem: NP-complete versus polynomial dichotomy (Q1686050) (← links)
- Minimal obstructions for a matrix partition problem in chordal graphs (Q2097166) (← links)
- \((k,l)\)-colourings and Ferrers diagram representations of cographs (Q2225413) (← links)
- Edge clique partition in \((k,\ell)\)-graphs (Q2243139) (← links)
- Stable-\(\Pi\) partitions of graphs (Q2255049) (← links)
- Dichotomy for tree-structured trigraph list homomorphism problems (Q2275926) (← links)
- Extended skew partition problem (Q2433705) (← links)
- Matrix partitions of perfect graphs (Q2433706) (← links)
- Fixed-parameter algorithms for the cocoloring problem (Q2440099) (← links)
- Graph partitions with prescribed patterns (Q2509761) (← links)
- Join colourings of chordal graphs (Q2515589) (← links)
- Partitioning cographs into cliques and stable sets (Q2568333) (← links)
- Independent packings in structured graphs (Q2583122) (← links)
- Maximum weight induced multicliques and complete multipartite subgraphs in directed path overlap graphs (Q2788740) (← links)
- A note on the bichromatic numbers of graphs (Q3061187) (← links)
- Characterizing –partitionable Cographs (Q3439349) (← links)
- Matrix Partitions with Finitely Many Obstructions (Q3439607) (← links)
- A Brooks‐Type Theorem for the Bichromatic Number (Q3466343) (← links)
- Approximation algorithms for maximum weight <i>k</i>-coverings of graphs by packings (Q5063275) (← links)
- On Injective Colourings of Chordal Graphs (Q5458556) (← links)
- On 2-Subcolourings of Chordal Graphs (Q5458558) (← links)
