Alternating kernels
From MaRDI portal
Publication:1693142
DOI10.1016/j.dam.2017.10.013zbMath1377.05075OpenAlexW4210694482MaRDI QIDQ1693142
Hortensia Galeana-Sánchez, Pietra Delgado-Escalante, Eugenia O'Reilly-Regueiro
Publication date: 11 January 2018
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.dam.2017.10.013
Related Items (4)
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 ⋮ On kernels by rainbow paths in arc-coloured digraphs
Cites Work
- On kernels and semikernels of digraphs
- On kernel-perfect critical digraphs
- On monochromatic paths in m-coloured tournaments
- A note on kernel-critical graphs
- On monochromatic paths in edge-coloured digraphs
- Alternating cycles in edge-partitioned graphs
- Planar kernel and Grundy with \(d\leq 3\), \(dout\leq 2\), \(din\leq 2\) are NP- complete
- Alternating Hamiltonian circuits in edge-coloured bipartite graphs
- On the existence of kernels and \(h\)-kernels in directed graphs
- Hamiltonian circuits determining the order of chromosomes
- On \((k,l)\)-kernels in generalized products
- Alternating cycles and paths in edge-coloured multigraphs: A survey
- A corrected version of the Duchet kernel conjecture
- Alternating cycles and trails in \(2\)-edge-coloured complete multigraphs
- Note on alternating directed cycles
- Absorbing sets in arc-coloured tournaments
- Alternating paths in edge-colored complete graphs
- On monochromatic paths and monochromatic 4-cycles in edge coloured bipartite tournaments
- On monochromatic paths and monochromatic cycles in edge coloured tournaments
- Perfect graphs, kernels, and cores of cooperative games
- Monochromatic paths and at most 2-coloured arc sets in edge-coloured tournaments
- Recent problems and results about kernels in directed graphs
- Solutions of irreflexive relations
- Alternating cycles in edge-colored graphs
- A sufficient condition for the existence of k-kernels in digraphs
- Semikernels and (k,l)-Kernels in Digraphs
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Alternating kernels
