The following pages link to Graphes Noyau-Parfaits (Q3912817):
Displaying 50 items.
- A sufficient condition for kernel perfectness of a digraph in terms of semikernels modulo \(F\) (Q270266) (← links)
- Kernels by monochromatic paths and color-perfect digraphs (Q274681) (← links)
- Some results on the structure of kernel-perfect and critical kernel-imperfect digraphs (Q299098) (← links)
- Cycles and transitivity by monochromatic paths in arc-coloured digraphs (Q321986) (← links)
- Expressive power of digraph solvability (Q409316) (← links)
- Finding kernels or solving SAT (Q414435) (← links)
- \(k\)-colored kernels (Q442210) (← links)
- Propositional discourse logic (Q484942) (← links)
- A new generalization of kernels in digraphs (Q516902) (← links)
- On kernels in perfect graphs (Q684411) (← links)
- On a class of kernel-perfect and kernel-perfect-critical graphs (Q685562) (← links)
- On the existence of (k,\(\ell)\)-kernels in digraphs (Q805626) (← links)
- Orientations of graphs in kernel theory (Q809100) (← links)
- \(\Gamma\)-cycles in arc-colored digraphs (Q907835) (← links)
- Kernels and some operations in edge-coloured digraphs (Q998342) (← links)
- Some sufficient conditions for the existence of kernels in infinite digraphs (Q1025568) (← links)
- Vertex- and edge-minimal and locally minimal graphs (Q1043552) (← links)
- On kernel-perfect critical digraphs (Q1076036) (← links)
- A parity digraph has a kernel (Q1080430) (← links)
- A theorem about a conjecture of H. Meyniel on kernel-perfect graphs (Q1081612) (← links)
- Parity graphs are kernel-M-solvable (Q1121920) (← links)
- A note on kernel-critical graphs (Q1150376) (← links)
- A counterexample to a conjecture of Meyniel on kernel-perfect graphs (Q1163568) (← links)
- Une généralisation du théorème de Richardson sur l'existence de noyaux dans les graphes orientes (Q1172646) (← links)
- Graphes parfaitement ordonnables généralisés. (Generalized perfectly orderable graphs) (Q1175981) (← links)
- Extending kernel perfect digraphs to kernel perfect critical digraphs (Q1182966) (← links)
- On the existence of kernels and \(h\)-kernels in directed graphs (Q1208364) (← links)
- On directed graphs with an independent covering set (Q1264153) (← links)
- Enumerating the kernels of a directed graph with no odd circuits (Q1332748) (← links)
- A corrected version of the Duchet kernel conjecture (Q1377724) (← links)
- A circular graph---counterexample to the Duchet kernel conjecture (Q1377838) (← links)
- Kernels in pretransitive digraphs. (Q1420591) (← links)
- On the existence of 3- and 4-kernels in digraphs (Q1690223) (← links)
- Kernels by properly colored paths in arc-colored digraphs (Q1744736) (← links)
- Discrete representation of the non-dominated set for multi-objective optimization problems using kernels (Q1753501) (← links)
- Kernels in directed graphs: A poison game (Q1801706) (← links)
- Kernels in some orientations of comparability graphs (Q1823257) (← 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)
- On monochromatic paths and monochromatic 4-cycles in edge coloured bipartite tournaments (Q1877676) (← links)
- On kernels by rainbow paths in arc-coloured digraphs (Q2053604) (← links)
- H-kernels by walks (Q2141098) (← links)
- Kernels by rainbow paths in arc-colored tournaments (Q2185722) (← links)
- Richardson's theorem in quasi-transitive and pre-transitive digraphs (Q2191277) (← links)
- Kernels in random graphs (Q2277494) (← links)
- An extension of Richardson's theorem in m-colored digraphs (Q2354614) (← links)
- Infinite kernel perfect digraphs (Q2409759) (← 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)
- On the existence of \((k,l)\)-kernels in infinite digraphs: a survey (Q2509534) (← links)
