Secure domination in cographs (Q2416434): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
Created claim: Wikidata QID (P12): Q128196498, #quickstatements; #temporary_batch_1726359655382
 
(One intermediate revision by one other user not shown)
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: Vertex Covers and Secure Domination in Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5298923 / 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: Q3065457 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5461685 / 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 graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On computing a minimum secure dominating set in block graphs / rank
 
Normal rank
Property / Wikidata QID
 
Property / Wikidata QID: Q128196498 / rank
 
Normal rank

Latest revision as of 02:24, 15 September 2024

scientific article
Language Label Description Also known as
English
Secure domination in cographs
scientific article

    Statements

    Identifiers