On kernels by monochromatic paths in the corona of digraphs

DOI10.2478/s11533-008-0044-6zbMath1152.05033OpenAlexW1974641029MaRDI QIDQ960689

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

zbMATH Keywords

countingkernel by monochromatic pathscorona of digraphsmonochromatic kernel-perfect

Mathematics Subject Classification ID

Paths and cycles (05C38) Coloring of graphs and hypergraphs (05C15) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Directed graphs (digraphs), tournaments (05C20)

Related Items (5)

Cycles and transitivity by monochromatic paths in arc-coloured digraphs ⋮ \(\Gamma\)-cycles in arc-colored digraphs ⋮ Kernels by monochromatic paths in digraphs with covering number 2 ⋮ Kernels by monochromatic paths in \(m\)-colored unions of quasi-transitive digraphs ⋮ \(H\)-paths and \(H\)-cycles in \(H\)-coloured digraphs

Cites Work

• On the corona of two graphs
• Monochromatic kernel-perfectness of special classes of digraphs
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: On kernels by monochromatic paths in the corona of digraphs