Total restrained domination in cubic graphs
From MaRDI portal
Publication:1043826
DOI10.1007/S00373-009-0854-8zbMath1211.05116OpenAlexW2084889638MaRDI QIDQ1043826
Hongxing Jiang, Erfang Shan, Li-ying Kang
Publication date: 9 December 2009
Published in: Graphs and Combinatorics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00373-009-0854-8
Related Items (6)
An improved upper bound on the total restrained domination number in cubic graphs ⋮ NP-completeness and APX-completeness of restrained domination in graphs ⋮ Total restrained domination in graphs ⋮ Restrained domination in cubic graphs ⋮ 2-colorings in \(k\)-regular \(k\)-uniform hypergraphs ⋮ Restrained and Total Restrained Domination in Graphs
Cites Work
- Unnamed Item
- Unnamed Item
- Paired-domination in claw-free cubic graphs
- Total restrained domination in trees
- Bounds on total domination in claw-free cubic graphs
- Total restrained domination in graphs with minimum degree two
- Total restrained domination in claw-free graphs
- Total restrained domination numbers of trees
- Nordhaus-Gaddum results for restrained domination and total restrained domination in graphs
- On total restrained domination in graphs
- Remarks on restrained domination and total restrained domination in graphs
- Total domination in graphs
- Algorithms for Vertex Partitioning Problems on Partial k-Trees
- Paired-domination in graphs
- Trees with restrained domination and total restrained domination numbers
This page was built for publication: Total restrained domination in cubic graphs
