Pages that link to "Item:Q2283107"
From MaRDI portal
The following pages link to Perfect graphs with polynomially computable kernels (Q2283107):
Displaying 5 items.
- Polynomial algorithms for kernels in comparability, permutation and \(P_4\)-free graphs (Q816574) (← links)
- Fractional kernels in digraphs (Q1366601) (← links)
- Perfect Digraphs (Q5251198) (← links)
- On the kernel and related problems in interval digraphs (Q6103517) (← links)
- Counting kernels in directed graphs with arbitrary orientations (Q6559392) (← links)