The following pages link to A note on kernel-critical graphs (Q1150376):
Displaying 26 items.
- 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)
- A Richardson's theorem version for \(\Pi\)-kernels (Q512571) (← links)
- A new generalization of kernels in digraphs (Q516902) (← links)
- On a class of kernel-perfect and kernel-perfect-critical graphs (Q685562) (← links)
- On kernels and semikernels of digraphs (Q787155) (← 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)
- On kernel-perfect critical digraphs (Q1076036) (← links)
- A counterexample to a conjecture of Meyniel on kernel-perfect graphs (Q1163568) (← links)
- Extending kernel perfect digraphs to kernel perfect critical digraphs (Q1182966) (← links)
- Normal fraternally orientable graphs satisfy the strong perfect graph conjecture (Q1313857) (← links)
- Enumerating the kernels of a directed graph with no odd circuits (Q1332748) (← links)
- Kernels in pretransitive digraphs. (Q1420591) (← links)
- Alternating kernels (Q1693142) (← 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)
- \(B_ 1\)- and \(B_ 2\)-orientable graphs in kernel theory (Q1897444) (← links)
- Perfect graphs, kernels, and cores of cooperative games (Q2433701) (← links)
- Kernels and perfectness in arc-local tournament digraphs (Q2433708) (← links)
- Kernels in quasi-transitive digraphs (Q2501570) (← links)
- Recent problems and results about kernels in directed graphs (Q2640613) (← links)
- Miscellaneous Digraph Classes (Q3120443) (← links)
- On Kernels of Graphs and Solutions of Games: A Synopsis Based on Relations and Fixpoints (Q3216679) (← links)
- \((H, k)\)-reachability in \(H\)-arc-colored digraphs (Q6044470) (← links)
