Recommendations
Cites work
- A corrected version of the Duchet kernel conjecture
- A note on kernel-critical graphs
- A sufficient condition for the existence of k-kernels in digraphs
- Absorbing sets in arc-coloured tournaments
- Alternating cycles and paths in edge-coloured multigraphs: A survey
- Alternating cycles and trails in \(2\)-edge-coloured complete multigraphs
- Alternating cycles in edge-colored graphs
- Alternating cycles in edge-partitioned graphs
- Alternating domination in arc-colored digraphs.
- Alternating Hamiltonian circuits in edge-coloured bipartite graphs
- Alternating paths in edge-colored complete graphs
- Hamiltonian circuits determining the order of chromosomes
- scientific article; zbMATH DE number 4134069 (Why is no real title available?)
- scientific article; zbMATH DE number 5551581 (Why is no real title available?)
- scientific article; zbMATH DE number 3722690 (Why is no real title available?)
- scientific article; zbMATH DE number 1944416 (Why is no real title available?)
- scientific article; zbMATH DE number 3801571 (Why is no real title available?)
- scientific article; zbMATH DE number 3803484 (Why is no real title available?)
- scientific article; zbMATH DE number 3448611 (Why is no real title available?)
- scientific article; zbMATH DE number 762736 (Why is no real title available?)
- scientific article; zbMATH DE number 2188332 (Why is no real title available?)
- Monochromatic paths and at most 2-coloured arc sets in edge-coloured tournaments
- Note on alternating directed cycles
- On \((k,l)\)-kernels in generalized products
- On \((k,l)\)-kernels in the Corona of digraphs
- On kernel-perfect critical digraphs
- On kernels and semikernels of digraphs
- On monochromatic paths and monochromatic 4-cycles in edge coloured bipartite tournaments
- On monochromatic paths and monochromatic cycles in edge coloured tournaments
- On monochromatic paths in edge-coloured digraphs
- On monochromatic paths in m-coloured tournaments
- On the existence of kernels and h-kernels in directed graphs
- Perfect graphs, kernels, and cores of cooperative games
- Planar kernel and Grundy with d 3, dout 2, din 2 are NP- complete
- Recent problems and results about kernels in directed graphs
- Semikernels and (k,l)-Kernels in Digraphs
- Solutions of irreflexive relations
- Theory of games and economic behavior.
Cited in
(9)- On kernels by rainbow paths in arc-coloured digraphs
- Kernels by rainbow paths in arc-colored tournaments
- \(H\)-kernels in unions of \(H\)-colored quasi-transitive digraphs
- Restricted domination in quasi-transitive and 3-quasi-transitive digraphs
- Alternating domination in arc-colored digraphs.
- (k,H)-kernels in nearly tournaments
- Panchromatic patterns by paths
- The theorem of Richardson and its generalizations: a survey
- Restricted reachability in infinite digraphs
This page was built for publication: Alternating kernels
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1693142)
