Pages that link to "Item:Q2433701"
From MaRDI portal
The following pages link to Perfect graphs, kernels, and cores of cooperative games (Q2433701):
Displaying 46 items.
- Richardson's theorem for \(k\)-colored kernels in strongly connected digraphs (Q260020) (← links)
- Kernels by monochromatic paths and color-perfect digraphs (Q274681) (← links)
- Richardson's theorem in \(H\)-coloured digraphs (Q292262) (← links)
- Some results on the structure of kernel-perfect and critical kernel-imperfect digraphs (Q299098) (← links)
- A characterization of locally semicomplete CKI-digraphs (Q343738) (← links)
- \(H\)-kernels in infinite digraphs (Q354449) (← links)
- Characterization of asymmetric CKI- and KP-digraphs with covering number at most 3 (Q392641) (← links)
- Expressive power of digraph solvability (Q409316) (← links)
- Finding kernels or solving SAT (Q414435) (← links)
- \(k\)-colored kernels (Q442210) (← links)
- Kernels in digraphs that are not kernel perfect (Q442354) (← links)
- \(k\)-kernels in \(k\)-transitive and \(k\)-quasi-transitive digraphs (Q442356) (← links)
- A new characterization of perfect graphs (Q442410) (← links)
- \((k + 1)\)-kernels and the number of \(k\)-kings in \(k\)-quasi-transitive digraphs (Q468446) (← links)
- Propositional discourse logic (Q484942) (← links)
- On panchromatic digraphs and the panchromatic number (Q489347) (← links)
- A Richardson's theorem version for \(\Pi\)-kernels (Q512571) (← links)
- Kernels by monochromatic paths in digraphs with covering number 2 (Q539857) (← links)
- \(\Pi\)-kernels in digraphs (Q897229) (← links)
- A note on kernels and Sperner's Lemma (Q967389) (← links)
- A polyhedral approach to the stability of a family of coalitions (Q968155) (← links)
- A corrected version of the Duchet kernel conjecture (Q1377724) (← links)
- Alternating kernels (Q1693142) (← links)
- Kernels by properly colored paths in arc-colored digraphs (Q1744736) (← links)
- From kernels in directed graphs to fixed points and negative cycles in Boolean networks (Q1949117) (← links)
- H-kernels by walks in an \(R_H (D)\) digraph (Q2176159) (← links)
- Kernels by rainbow paths in arc-colored tournaments (Q2185722) (← links)
- On effectivity functions of game forms (Q2268107) (← links)
- Perfect graphs with polynomially computable kernels (Q2283107) (← links)
- About \((k, l)\)-kernels, semikernels and Grundy functions in partial line digraphs (Q2312064) (← links)
- On the complexity of the \(k\)-kernel problem on cyclically \(k\)-partite digraphs (Q2330089) (← links)
- \((k-1)\)-kernels in strong \(k\)-transitive digraphs (Q2344009) (← links)
- An extension of Richardson's theorem in m-colored digraphs (Q2354614) (← links)
- War and peace in veto voting (Q2456439) (← links)
- \(H\)-kernels and \(H\)-obstructions in \(H\)-colored digraphs (Q2515566) (← links)
- Quasi-Transitive Digraphs and Their Extensions (Q3120440) (← links)
- Miscellaneous Digraph Classes (Q3120443) (← links)
- Robust correspondence recognition for computer vision (Q3298596) (← links)
- Domination in Digraphs (Q3384119) (← links)
- Disjoint quasi-kernels in digraphs (Q3522851) (← links)
- H-absorbence and H-independence in 3-quasi-transitive H-coloured digraphs. (Q4986281) (← links)
- $H$-kernels by walks in subdivision digraph (Q5139338) (← links)
- On kernels in strongly game-perfect digraphs and a characterisation of weakly game-perfect digraphs (Q5154626) (← links)
- Perfect Digraphs (Q5251198) (← links)
- CKI-digraphs, generalized sums and partitions of digraphs (Q5964980) (← links)
- On the kernel and related problems in interval digraphs (Q6103517) (← links)
