Pages that link to "Item:Q2640613"
From MaRDI portal
The following pages link to Recent problems and results about kernels in directed graphs (Q2640613):
Displaying 46 items.
- 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)
- Characterization of asymmetric CKI- and KP-digraphs with covering number at most 3 (Q392641) (← links)
- Finding kernels or solving SAT (Q414435) (← links)
- A new characterization of perfect graphs (Q442410) (← links)
- On panchromatic digraphs and the panchromatic number (Q489347) (← links)
- A new generalization of kernels in digraphs (Q516902) (← links)
- Kernels by monochromatic paths in digraphs with covering number 2 (Q539857) (← links)
- Graph theoretical structures in logic programs and default theories (Q672050) (← links)
- On a class of kernel-perfect and kernel-perfect-critical graphs (Q685562) (← links)
- Kernels in perfect line-graphs (Q908943) (← links)
- Kernels and partial line digraphs (Q990794) (← links)
- Vertex- and edge-minimal and locally minimal graphs (Q1043552) (← links)
- Enumerating the kernels of a directed graph with no odd circuits (Q1332748) (← links)
- A characterization of normal fraternally orientable perfect graphs (Q1357743) (← links)
- A corrected version of the Duchet kernel conjecture (Q1377724) (← links)
- A circular graph---counterexample to the Duchet kernel conjecture (Q1377838) (← links)
- Kernels in a special class of digraphs (Q1377857) (← links)
- On kernel-perfect orientations of line graphs (Q1584425) (← links)
- Closure systems and their structure (Q1602560) (← links)
- Alternating kernels (Q1693142) (← links)
- Combinatorial games on a graph (Q1916376) (← links)
- On monochromatic paths and monochromatic cycles in edge coloured tournaments (Q1923509) (← links)
- A nondeterministic well-founded semantics (Q1924729) (← links)
- Stable matching with uncertain pairwise preferences (Q2078608) (← links)
- Kernels by rainbow paths in arc-colored tournaments (Q2185722) (← links)
- \(H\)-kernels in unions of \(H\)-colored quasi-transitive digraphs (Q2227102) (← links)
- Restricted domination in quasi-transitive and 3-quasi-transitive digraphs (Q2231781) (← links)
- \(H\)-paths and \(H\)-cycles in \(H\)-coloured digraphs (Q2345526) (← links)
- An extension of Richardson's theorem in m-colored digraphs (Q2354614) (← links)
- Infinite kernel perfect digraphs (Q2409759) (← links)
- Independent sets and non-augmentable paths in generalizations of tournaments (Q2427505) (← links)
- Perfect graphs, kernels, and cores of cooperative games (Q2433701) (← links)
- Kernels and perfectness in arc-local tournament digraphs (Q2433708) (← links)
- On the complexity of the 3-kernel problem in some classes of digraphs (Q2442275) (← links)
- Kernels in planar digraphs (Q2485283) (← links)
- Kernels of directed graph Laplacians (Q2500958) (← links)
- Strong kernel number in certain oriented cycle extension of graphs (Q2516506) (← links)
- Monochromatic paths and at most 2-coloured arc sets in edge-coloured tournaments (Q2573805) (← links)
- Experimental investigation of sufficient criteria for relations to have kernels (Q2695346) (← links)
- Miscellaneous Digraph Classes (Q3120443) (← links)
- Recent problems and results about kernels in directed graphs (Q3822190) (← links)
- Perfect graphs and kernels (Q3822191) (← links)
- H-absorbence and H-independence in 3-quasi-transitive H-coloured digraphs. (Q4986281) (← links)
- CKI-digraphs, generalized sums and partitions of digraphs (Q5964980) (← links)
- On the kernel and related problems in interval digraphs (Q6103517) (← links)
