The following pages link to On weakly ordered systems (Q5834632):
Displaying 22 items.
- Some results on the structure of kernel-perfect and critical kernel-imperfect digraphs (Q299098) (← links)
- Finding kernels or solving SAT (Q414435) (← links)
- On kernels and semikernels of digraphs (Q787155) (← links)
- Some sufficient conditions for the existence of kernels in infinite digraphs (Q1025568) (← links)
- On kernel-perfect critical digraphs (Q1076036) (← links)
- Extending kernel perfect digraphs to kernel perfect critical digraphs (Q1182966) (← links)
- Towards the small quasi-kernel conjecture (Q2088687) (← links)
- Perfect graphs with polynomially computable kernels (Q2283107) (← links)
- On the complexity of the \(k\)-kernel problem on cyclically \(k\)-partite digraphs (Q2330089) (← links)
- On the complexity of the 3-kernel problem in some classes of digraphs (Q2442275) (← links)
- On the existence of \((k,l)\)-kernels in infinite digraphs: a survey (Q2509534) (← links)
- Über die Bestimmung von Kernen in endlichen Graphen (Q2561236) (← links)
- On Kernels of Graphs and Solutions of Games: A Synopsis Based on Relations and Fixpoints (Q3216679) (← links)
- On a Theorem of Richardson (Q3249007) (← links)
- Domination in Digraphs (Q3384119) (← links)
- New sufficient conditions for the existence of kernels in digraphs (Q3439351) (← links)
- Kernel perfect and critical kernel imperfect digraphs structure (Q3439612) (← links)
- (Q3898518) (← links)
- (Q3952119) (← links)
- (Q4145732) (← links)
- (Q4953557) (← links)
- On the kernel and related problems in interval digraphs (Q6103517) (← links)
