The capture time of grids (Q616367): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
Import241208061232 (talk | contribs)
Normalize DOI.
 
(6 intermediate revisions by 6 users not shown)
Property / DOI
 
Property / DOI: 10.1016/j.disc.2010.10.002 / rank
Normal rank
 
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2171304259 / rank
 
Normal rank
Property / arXiv ID
 
Property / arXiv ID: 1008.4424 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3418339 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The capture time of a graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Cop-win graphs with maximum capture-time / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5445040 / 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: A game of cops and robbers played on products of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Vertex-to-vertex pursuit in a graph / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1016/J.DISC.2010.10.002 / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 22:38, 9 December 2024

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

    Statements

    The capture time of grids (English)
    0 references
    0 references
    7 January 2011
    0 references
    cops and robber game
    0 references
    capture time
    0 references
    Cartesian products
    0 references
    grids
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references