A greedy partition lemma for directed domination

DOI10.1016/j.disopt.2011.03.003zbMath1236.05142arXiv1010.2467OpenAlexW2081115772WikidataQ124792155 ScholiaQ124792155MaRDI QIDQ665996

Yair Caro, Michael A. Henning

Publication date: 7 March 2012

Published in: Discrete Optimization (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1010.2467

zbMATH Keywords

independence numberoriented graphdirected domination

Mathematics Subject Classification ID

Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)

Related Items (4)

Directed domination in oriented hypergraphs ⋮ Directed domination in oriented graphs ⋮ Projects in (t, r) Broadcast Domination ⋮ Domination in Digraphs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Directed domination in oriented graphs
• Decompositions of partially ordered sets into chains and antichains of given size
• On independent generalized degrees and independence numbers in \(K(1,m)\)- free graphs
• On the ratio of optimal integral and fractional covers
• On the out-domination and in-domination numbers of a digraph
• Dominating Set and Converse Dominating Set of a Directed Graph
• On a Problem in Graph Theory
• 25 pretty graph colouring problems

This page was built for publication: A greedy partition lemma for directed domination