Algorithmic aspect of stratified domination in graphs

DOI10.1016/j.ipl.2013.08.008zbMath1284.68282OpenAlexW2002980470WikidataQ62041765 ScholiaQ62041765MaRDI QIDQ2445324

Yanyan Li

Publication date: 14 April 2014

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ipl.2013.08.008

zbMATH Keywords

treebipartite graphdesign of algorithmsgraph algorithmschordal graphNP-completeplanar graphdomination\(F\)-domination\(k\)-stratified graph

Mathematics Subject Classification ID

Planar graphs; geometric and topological aspects of graph theory (05C10) Coloring of graphs and hypergraphs (05C15) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Graph algorithms (graph-theoretic aspects) (05C85) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)

Related Items (2)

\(F_3\)-domination problem of graphs ⋮ Stratified Domination

Cites Work

• A survey of stratified domination in graphs
• Stratification and domination in graphs
• Stratification and domination in graphs. II
• Stratification and domination in graphs with minimum degree two
• Simultaneous stratification and domination in graphs with minimum degree two
• Realizable triples for stratified domination in graphs
• On stratification and domination in graphs
• Total domination in graphs
• Stratidistance in stratified graphs
• Algorithms for Vertex Partitioning Problems on Partial k-Trees
• Distance in stratified graphs
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Algorithmic aspect of stratified domination in graphs