m-Secure vertex cover of a graph (Q4644785): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
Created claim: Wikidata QID (P12): Q129323625, #quickstatements; #temporary_batch_1724709170382
 
(One intermediate revision by one other user not shown)
Property / cites work
 
Property / cites work: Q5449165 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3636214 / 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: Q5461685 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parameterized algorithm for eternal vertex cover / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4681994 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3635564 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3059008 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graphs with equal eternal vertex cover and eternal domination numbers / rank
 
Normal rank
Property / cites work
 
Property / cites work: Secure restrained domination in graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Further results on secure restrained domination in graphs / rank
 
Normal rank
Property / Wikidata QID
 
Property / Wikidata QID: Q129323625 / rank
 
Normal rank

Latest revision as of 23:17, 26 August 2024

scientific article; zbMATH DE number 6998811
Language Label Description Also known as
English
m-Secure vertex cover of a graph
scientific article; zbMATH DE number 6998811

    Statements

    m-Secure vertex cover of a graph (English)
    0 references
    9 January 2019
    0 references
    domination
    0 references
    secure domination
    0 references
    vertex cover
    0 references

    Identifiers