Pages that link to "Item:Q817772"
From MaRDI portal
The following pages link to List matrix partitions of chordal graphs (Q817772):
Displayed 30 items.
- Obstructions to partitions of chordal graphs (Q383740) (← links)
- Colouring, constraint satisfaction, and complexity (Q458466) (← links)
- The external constraint 4 nonempty part sandwich problem (Q531610) (← links)
- The complexity of list edge-partitions for simple graphs (Q730267) (← links)
- Digraph matrix partitions and trigraph homomorphisms (Q860407) (← links)
- Polarity of chordal graphs (Q955313) (← links)
- \(2K_{2}\) vertex-set partition into nonempty parts (Q966027) (← links)
- List matrix partitions of graphs representing geometric configurations (Q1741515) (← links)
- On the (parameterized) complexity of recognizing well-covered (\(r\),\(\ell\))-graph (Q1784741) (← links)
- Minimal obstructions for a matrix partition problem in chordal graphs (Q2097166) (← 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)
- Dichotomy for tree-structured trigraph list homomorphism problems (Q2275926) (← links)
- On the thinness and proper thinness of a graph (Q2414456) (← links)
- Matrix partitions of perfect graphs (Q2433706) (← links)
- On realizations of point determining graphs, and obstructions to full homomorphisms (Q2477389) (← links)
- Graph partitions with prescribed patterns (Q2509761) (← links)
- Join colourings of chordal graphs (Q2515589) (← links)
- Matrix partitions of split graphs (Q2636832) (← links)
- On the probe problem for \((r,\ell )\)-well-coveredness (Q2695302) (← links)
- On the (Parameterized) Complexity of Recognizing Well-Covered $$(r,\ell )$$ -graphs (Q2958335) (← links)
- Matrix Partitions with Finitely Many Obstructions (Q3439607) (← links)
- 2K2 vertex-set partition into nonempty parts (Q3503567) (← links)
- (Q5075768) (← links)
- Almost All Friendly Matrices Have Many Obstructions (Q5251620) (← links)
- On Injective Colourings of Chordal Graphs (Q5458556) (← links)
- On 2-Subcolourings of Chordal Graphs (Q5458558) (← links)
- Complexity of \(C_k\)-coloring in hereditary classes of graphs (Q6040658) (← links)
- On the complexity of coloring ‐graphs (Q6092550) (← links)
- List homomorphism: beyond the known boundaries (Q6164000) (← links)