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

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
Normalize DOI.
 
(4 intermediate revisions by 4 users not shown)
Property / DOI
 
Property / DOI: 10.1016/j.ipl.2019.01.005 / rank
Normal rank
 
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.ipl.2019.01.005 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2910118765 / rank
 
Normal rank
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
Property / DOI
 
Property / DOI: 10.1016/J.IPL.2019.01.005 / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 06:20, 11 December 2024

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

    Statements

    Identifiers