On kernels by monochromatic paths in the corona of digraphs
DOI10.2478/S11533-008-0044-6zbMATH Open1152.05033OpenAlexW1974641029MaRDI QIDQ960689FDOQ960689
Authors: Iwona Włoch 
Publication date: 5 January 2009
Published in: Central European Journal of Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.2478/s11533-008-0044-6
Recommendations
Directed graphs (digraphs), tournaments (05C20) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Coloring of graphs and hypergraphs (05C15) Paths and cycles (05C38)
Cites Work
Cited In (11)
- On \(k\)-independent sets and \((k,l)\)-kernels in the corona of graphs
- \(H\)-paths and \(H\)-cycles in \(H\)-coloured digraphs
- Kernels by monochromatic paths and color-perfect digraphs
- Kernels by monochromatic paths in digraphs with covering number 2
- Kernels by monochromatic paths in \(m\)-colored unions of quasi-transitive digraphs
- Title not available (Why is that?)
- Cycles and transitivity by monochromatic paths in arc-coloured digraphs
- On \((k,l)\)-kernels in the Corona of digraphs
- \(\Gamma\)-cycles in arc-colored digraphs
- On kernels by monochromatic paths in \(D\)-join.
- Monochromatic kernel-perfectness of special classes of digraphs
This page was built for publication: On kernels by monochromatic paths in the corona of digraphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q960689)
