H-absorbence and H-independence in 3-quasi-transitive H-coloured digraphs.
From MaRDI portal
Publication:4986281
Recommendations
- Monochromatic absorbency and independence in 3-quasi-transitive digraphs
- \(H\)-kernels in unions of \(H\)-colored quasi-transitive digraphs
- \(H\)-paths and \(H\)-cycles in \(H\)-coloured digraphs
- \(H\)-coloring degree-bounded (acyclic) digraphs
- \(H\)-kernels and \(H\)-obstructions in \(H\)-colored digraphs
- On the structure of strong 3-quasi-transitive digraphs
- -panchromatic digraphs
- Underlying graphs of 3-quasi-transitive digraphs and 3-transitive digraphs
- scientific article; zbMATH DE number 2156263
- Independent and monochromatic absorbent sets in infinite digraphs
Cites work
- scientific article; zbMATH DE number 3900787 (Why is no real title available?)
- scientific article; zbMATH DE number 1153462 (Why is no real title available?)
- scientific article; zbMATH DE number 1498519 (Why is no real title available?)
- A proof of the Erdös-Sands-Sauer-Woodrow conjecture
- Combinatorial game theory foundations applied to digraph kernels
- Counterexamples of the 0-1 Law for Fragments of Existential Second-Order Logic: an Overview
- Kernels in directed graphs: A poison game
- On monochromatic paths in edge-coloured digraphs
- Perfect graphs, kernels, and cores of cooperative games
- Reachability problems in edge-colored digraphs
- Recent problems and results about kernels in directed graphs
- Restricted domination in arc-colored digraphs
This page was built for publication: H-absorbence and H-independence in 3-quasi-transitive H-coloured digraphs.
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4986281)
