Infinite quasi-transitive digraphs with domination number 2

DOI10.1016/J.DAM.2017.02.028MaRDI QIDQ2357773zbMATH OpenOpenAlexFDO

Authors Hortensia Galeana-Sánchez, M. 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

dominating setsquasi-transitive digraphsvertex partitions

Mathematics Subject Classification ID

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

Recommendations

• Quasi-transitive digraphs and their extensions
• An infinite family of vertex-primitive 2-arc-transitive digraphs
• Two-ended quasi-transitive graphs
• An infinite family of sharply two-arc transitive digraphs
• A note on infinite transitive graphs
• Infinite graphs with finite dominating sets
• The Hadwiger number of infinite vertex-transitive graphs
• Restricted domination in quasi-transitive and 3-quasi-transitive digraphs
• Quasi‐transitive digraphs
• On vertex transitive graphs of infinite degree

Cites work

• A Constructive Solution to a Tournament Problem
• Characterization of asymmetric CKI- and KP-digraphs with covering number at most 3
• Diconnected Orientations and a Conjecture of Las Vergnas
• Domination in transitive colorings of tournaments
• Extension of Turan's and Brooks' Theorems and New Notions of Stability and Coloring in Digraphs
• scientific article; zbMATH DE number 1095171 (Why is no real title available?)
• scientific article; zbMATH DE number 1095172 (Why is no real title available?)
• scientific article; zbMATH DE number 1498519 (Why is no real title available?)
• Kernels by monochromatic paths in m-colored unions of quasi-transitive digraphs
• Kernels in quasi-transitive digraphs
• On monochromatic paths in edge-coloured digraphs
• Quasi‐transitive digraphs
• The dichromatic number of a digraph

Cited in

(3)

• The domination number of round digraphs
• A proof of the Erdös-Sands-Sauer-Woodrow conjecture
• Covering 2‐colored complete digraphs by monochromatic d d‐dominating digraphs

This page was built for publication: Infinite quasi-transitive digraphs with domination number 2

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2357773)