The secure domination problem in cographs (Q1730021): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Secure domination in proper interval graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the secure domination numbers of maximal outerplanar graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A linear algorithm for secure domination in trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: On minimum secure dominating sets of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5298923 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5461685 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Irredundance, secure domination and maximum degree in trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complement reducible graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Linear Recognition Algorithm for Cographs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Secure domination and secure total domination in graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On secure domination in trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: On secure domination in graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On computing a minimum secure dominating set in block graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The complexity of secure domination problem in graphs / rank
 
Normal rank

Latest revision as of 15:24, 18 July 2024

scientific article
Language Label Description Also known as
English
The secure domination problem in cographs
scientific article

    Statements

    Identifiers