\(F_3\)-domination problem of graphs
From MaRDI portal
Publication:2251138
DOI10.1007/s10878-012-9563-yzbMath1326.90092OpenAlexW2104877741MaRDI QIDQ2251138
Publication date: 11 July 2014
Published in: Journal of Combinatorial Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10878-012-9563-y
Related Items (1)
Cites Work
- A survey of stratified domination in graphs
- Stratification and domination in graphs
- Stratification and domination in graphs. II
- Algorithmic aspect of stratified domination in graphs
- 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
This page was built for publication: \(F_3\)-domination problem of graphs