Restricted domination in arc-colored digraphs

zbMATH Open1301.05147MaRDI QIDQ2512571FDOQ2512571

Hortensia Galeana-Sánchez, Pietra Delgado-Escalante

Publication date: 7 August 2014

Published in: AKCE International Journal of Graphs and Combinatorics (Search for Journal in Brave)

zbMATH Keywords

directed walkdirected pathinfinite digraph

Mathematics Subject Classification ID

Directed graphs (digraphs), tournaments (05C20) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Coloring of graphs and hypergraphs (05C15) Paths and cycles (05C38) Infinite graphs (05C63)

Cited In (17)

• Trails in arc-colored digraphs avoiding forbidden transitions
• Richardson's theorem in \(H\)-coloured digraphs
• Some conditions for the existence of Euler \(H\)-trails
• -panchromatic digraphs
• \(H\)-kernels in unions of \(H\)-colored quasi-transitive digraphs
• Restricted domination in quasi-transitive and 3-quasi-transitive digraphs
• A generalization of properly colored paths and cycles in edge-colored graphs
• \(H\)-kernels in infinite digraphs
• \(H\)-kernels in \(H\)-colored digraphs without \(( \xi_1 , \xi , \xi_2 )-H\)-subdivisions of \(\overrightarrow{C_3} \)
• \(H\)-kernels and \(H\)-obstructions in \(H\)-colored digraphs
• \(H\)-kernels by walks in \(H\)-colored digraphs and the color-class digraph
• H-absorbence and H-independence in 3-quasi-transitive H-coloured digraphs.
• Arc-chromatic number of digraphs in which every vertex has bounded outdegree or bounded indegree
• Euler dynamic H -trails in edge-colored graphs
• \((\mathscr{A}, \mathscr{B})\)-kernels and Sands, Sauer and Woodrow's theorem
• Dynamic cycles in edge-colored multigraphs
• Extensions of Richardson’s theorem for infinite digraphs and (𝒜, ℬ)-kernels

Recommendations

• Title not available (Why is that?) 👍 👎
• Title not available (Why is that?) 👍 👎
• Title not available (Why is that?) 👍 👎
• Title not available (Why is that?) 👍 👎
• Restricted arc-connectivity of digraphs 👍 👎
• Restrained domination in graphs 👍 👎
• Restricted domination in graphs 👍 👎
• On restricted domination in graphs 👍 👎
• On restricted arc-connectivity of regular digraphs 👍 👎
• Restricted total domination in graphs 👍 👎

This page was built for publication: Restricted domination in arc-colored digraphs

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