The eternal dominating set problem for interval graphs (Q1739215): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
Created claim: Wikidata QID (P12): Q128455086, #quickstatements; #temporary_batch_1723800143925
 
(3 intermediate revisions by 3 users not shown)
Property / OpenAlex ID
 
Property / OpenAlex ID: W2963686672 / rank
 
Normal rank
Property / arXiv ID
 
Property / arXiv ID: 1808.09591 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Testing for the consecutive ones property, interval graphs, and graph planarity using PQ-tree algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: The eternal dominating set problem for proper interval graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4820838 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A note on the eternal dominating set problem / 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: Protecting a graph with mobile guards / rank
 
Normal rank
Property / Wikidata QID
 
Property / Wikidata QID: Q128455086 / rank
 
Normal rank

Latest revision as of 11:24, 16 August 2024

scientific article
Language Label Description Also known as
English
The eternal dominating set problem for interval graphs
scientific article

    Statements

    The eternal dominating set problem for interval graphs (English)
    0 references
    0 references
    0 references
    26 April 2019
    0 references
    0 references
    0 references
    0 references
    0 references
    combinatorial problems
    0 references
    interval graphs
    0 references
    eternal dominating set
    0 references
    neocolonization
    0 references
    0 references
    0 references
    0 references