Infinite quasi-transitive digraphs with domination number 2

DOI10.1016/j.dam.2017.02.028zbMath1365.05108OpenAlexW2611440217MaRDI QIDQ2357773

Hortensia Galeana-Sánchez, Mika Olsen

Publication date: 14 June 2017

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.dam.2017.02.028

zbMATH Keywords

vertex partitionsdominating setsquasi-transitive digraphs

Mathematics Subject Classification ID

Graphs and abstract algebra (groups, rings, fields, etc.) (05C25) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Directed graphs (digraphs), tournaments (05C20)

Related Items

The domination number of round digraphs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Characterization of asymmetric CKI- and KP-digraphs with covering number at most 3
• Domination in transitive colorings of tournaments
• Kernels by monochromatic paths in \(m\)-colored unions of quasi-transitive digraphs
• On monochromatic paths in edge-coloured digraphs
• The dichromatic number of a digraph
• Kernels in quasi-transitive digraphs
• Extension of Turan's and Brooks' Theorems and New Notions of Stability and Coloring in Digraphs
• Diconnected Orientations and a Conjecture of Las Vergnas
• Quasi‐transitive digraphs
• A Constructive Solution to a Tournament Problem