Pages that link to "Item:Q3745863"
From MaRDI portal
The following pages link to A sufficient condition for a digraph to be kernel-perfect (Q3745863):
Displaying 18 items.
- A sufficient condition for kernel perfectness of a digraph in terms of semikernels modulo \(F\) (Q270266) (← links)
- Some results on the structure of kernel-perfect and critical kernel-imperfect digraphs (Q299098) (← links)
- A new generalization of kernels in digraphs (Q516902) (← links)
- Graph theoretical structures in logic programs and default theories (Q672050) (← links)
- Kernels and some operations in edge-coloured digraphs (Q998342) (← links)
- A note on Duchet's conjecture (Q1011876) (← links)
- Some sufficient conditions for the existence of kernels in infinite digraphs (Q1025568) (← links)
- A new method to extend kernel-perfect graphs to kernel-perfect critical graphs (Q1121904) (← links)
- Extending kernel perfect digraphs to kernel perfect critical digraphs (Q1182966) (← links)
- Kernels in a special class of digraphs (Q1377857) (← links)
- Kernels in pretransitive digraphs. (Q1420591) (← links)
- On kernels in i-triangulated graphs (Q1821791) (← links)
- A combinatorial theorem on ordered circular sequences of \(n_1\) \(u\)'s and \(n_2\) \(v\)'s with application to kernel-perfect graphs (Q1873579) (← links)
- Unions of digraphs which become kernel perfect (Q2420420) (← links)
- Perfect graphs, kernels, and cores of cooperative games (Q2433701) (← links)
- Kernels in quasi-transitive digraphs (Q2501570) (← links)
- Domination in Digraphs (Q3384119) (← links)
- On the kernel and related problems in interval digraphs (Q6103517) (← links)
