The capture time of a graph (Q1045043): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Removed claims
ReferenceBot (talk | contribs)
Changed an Item
 
(3 intermediate revisions by 3 users not shown)
Property / author
 
Property / author: Petr A. Golovach / rank
 
Normal rank
Property / author
 
Property / author: Geňa Hahn / 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.disc.2008.04.004 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2035417355 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3418339 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the cop number of a graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3558603 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The random graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Asymmetric graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: An annotated bibliography on guaranteed graph searching / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4198056 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The complexity of pursuit on a graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5445040 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On cop-win graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A note on \(k\)-cop, \(l\)-robber games on graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4352272 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4828516 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A special planar satisfiability problem and a consequence of its NP- completeness / rank
 
Normal rank
Property / cites work
 
Property / cites work: Vertex-to-vertex pursuit in a graph / rank
 
Normal rank

Latest revision as of 07:53, 2 July 2024

scientific article
Language Label Description Also known as
English
The capture time of a graph
scientific article

    Statements

    The capture time of a graph (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    15 December 2009
    0 references
    0 references
    graph
    0 references
    cop number
    0 references
    search number
    0 references
    capture time
    0 references
    bounded-time cop number
    0 references
    chordal graph
    0 references
    infinite random graph
    0 references
    NP-complete
    0 references
    0 references