The following pages link to Perfect Digraphs (Q5251198):
Displaying 20 items.
- Strict chordal and strict split digraphs (Q516787) (← links)
- Acyclic coloring parameterized by directed clique-width (Q831699) (← links)
- Adamant digraphs (Q1104933) (← links)
- Ends in digraphs (Q1584206) (← links)
- A note on coloring digraphs of large girth (Q2004076) (← links)
- Dichromatic number and forced subdivisions (Q2072176) (← links)
- Point partition numbers: perfect graphs (Q2115144) (← links)
- Game-perfect semiorientations of forests (Q2118241) (← links)
- The digrundy number of digraphs (Q2142695) (← links)
- Perfect graphs with polynomially computable kernels (Q2283107) (← links)
- Hajós and Ore constructions for digraphs (Q2309234) (← links)
- Deza digraphs. II. (Q2472831) (← links)
- Miscellaneous Digraph Classes (Q3120443) (← links)
- (Q3544709) (← links)
- Unit and proper bitolerance digraphs (Q4333461) (← links)
- A semi-strong perfect digraph theorem (Q4956212) (← links)
- Digraphs and Variable Degeneracy (Q5062115) (← links)
- On kernels in strongly game-perfect digraphs and a characterisation of weakly game-perfect digraphs (Q5154626) (← links)
- Extendiendo un resultado de coloraciones de gráficas a coloraciones de digráficas (Q5882209) (← links)
- Digraph coloring and distance to acyclicity (Q6614618) (← links)
