Total restrained domination in claw-free graphs with minimum degree at least two (Q411852): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: On total restrained domination in graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bounds on the total restrained domination number of a graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: An upper bound on the total restrained domination number of a tree / rank
 
Normal rank
Property / cites work
 
Property / cites work: Total restrained domination in trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Nordhaus-Gaddum results for restrained domination and total restrained domination in graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4368729 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Total restrained domination in graphs with minimum degree two / rank
 
Normal rank
Property / cites work
 
Property / cites work: Total restrained domination in claw-free graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithms for Vertex Partitioning Problems on Partial k-Trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Remarks on restrained domination and total restrained domination in graphs / rank
 
Normal rank

Latest revision as of 03:54, 5 July 2024

scientific article
Language Label Description Also known as
English
Total restrained domination in claw-free graphs with minimum degree at least two
scientific article

    Statements