-panchromatic digraphs
From MaRDI portal
Recommendations
- A dichotomy for the kernel by H‐walks problem in digraphs
- Restricted domination in quasi-transitive and 3-quasi-transitive digraphs
- \(H\)-kernels by walks in \(H\)-colored digraphs and the color-class digraph
- Richardson's theorem in \(H\)-coloured digraphs
- \(H\)-kernels in infinite digraphs
- \(H\)-kernels in \(H\)-colored digraphs without \(( \xi_1 , \xi , \xi_2 )-H\)-subdivisions of \(\overrightarrow{C_3} \)
- On panchromatic patterns
- Restricted domination in arc-colored digraphs
- New classes of panchromatic digraphs
- H-kernels by walks in an \(R_H (D)\) digraph
Cites work
- scientific article; zbMATH DE number 1153462 (Why is no real title available?)
- scientific article; zbMATH DE number 3060538 (Why is no real title available?)
- scientific article; zbMATH DE number 3106184 (Why is no real title available?)
- New classes of panchromatic digraphs
- On panchromatic digraphs and the panchromatic number
- On panchromatic patterns
- Reachability problems in edge-colored digraphs
- Restricted domination in arc-colored digraphs
- Solutions of irreflexive relations
Cited in
(7)- A generalization of properly colored paths and cycles in edge-colored graphs
- On panchromatic patterns
- New classes of panchromatic digraphs
- On panchromatic digraphs and the panchromatic number
- H-absorbence and H-independence in 3-quasi-transitive H-coloured digraphs.
- Surjective H-Colouring over Reflexive Digraphs
- (k,H)-kernels in nearly tournaments
This page was built for publication: -panchromatic digraphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5154593)