H-absorbence and H-independence in 3-quasi-transitive H-coloured digraphs.
From MaRDI portal
Publication:4986281
DOI10.11575/CDM.V16I1.62258zbMATH Open1462.05157OpenAlexW3157237898MaRDI QIDQ4986281FDOQ4986281
Authors: Hortensia Galeana-Sánchez, Eugenia O'Reilly-Regueiro 
Publication date: 27 April 2021
Full work available at URL: https://doi.org/10.11575/cdm.v16i1.62258
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
Directed graphs (digraphs), tournaments (05C20) Coloring of graphs and hypergraphs (05C15) Paths and cycles (05C38)
Cites Work
- On monochromatic paths in edge-coloured digraphs
- Perfect graphs, kernels, and cores of cooperative games
- Title not available (Why is that?)
- Recent problems and results about kernels in directed graphs
- Reachability problems in edge-colored digraphs
- Restricted domination in arc-colored digraphs
- Title not available (Why is that?)
- Counterexamples of the 0-1 Law for Fragments of Existential Second-Order Logic: an Overview
- Title not available (Why is that?)
- Combinatorial game theory foundations applied to digraph kernels
- A proof of the Erdös-Sands-Sauer-Woodrow conjecture
- Kernels in directed graphs: A poison game
Cited In (1)
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)
