H-absorbence and H-independence in 3-quasi-transitive H-coloured digraphs.

DOI10.11575/cdm.v16i1.62258zbMath1462.05157OpenAlexW3157237898MaRDI QIDQ4986281

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

zbMATH Keywords

loopless asymmetric 3-quasi-transitive arc-coloured digraph

Mathematics Subject Classification ID

Paths and cycles (05C38) Coloring of graphs and hypergraphs (05C15) Directed graphs (digraphs), tournaments (05C20)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• On monochromatic paths in edge-coloured digraphs
• Combinatorial game theory foundations applied to digraph kernels
• Kernels in directed graphs: A poison game
• A proof of the Erdös-Sands-Sauer-Woodrow conjecture
• Perfect graphs, kernels, and cores of cooperative games
• Restricted domination in arc-colored digraphs
• Recent problems and results about kernels in directed graphs
• Reachability problems in edge-colored digraphs
• Counterexamples of the 0-1 Law for Fragments of Existential Second-Order Logic: an Overview

This page was built for publication: H-absorbence and H-independence in 3-quasi-transitive H-coloured digraphs.