Cops and Robbers on Graphs Based on Designs (Q2864796): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Removed claim: author (P16): Item:Q385378
Import241208061232 (talk | contribs)
Normalize DOI.
 
(4 intermediate revisions by 4 users not shown)
Property / DOI
 
Property / DOI: 10.1002/jcd.21331 / rank
Normal rank
 
Property / author
 
Property / author: Andrea C. Burgess / 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.1002/jcd.21331 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1821740204 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A survey on the existence of<i>G</i>-Designs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A game of cops and robbers / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3090934 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Construction of Sets of Mutually Orthogonal Latin Squares and the Falsity of a Conjecture of Euler / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Graphs that do not Contain a Thomsen Graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some maximal arcs in finite projective planes / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the number of edges of quadrilateral-free graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Eigenvalue bounds for independent sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Meyniel's conjecture of the cop number / rank
 
Normal rank
Property / cites work
 
Property / cites work: Pancyclic BIBD block-intersection graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the independence number of the Erdős‐Rényi and projective norm graphs and a related hypergraph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Vertex-to-vertex pursuit in a graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3565878 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Truncated transversal designs: A new lower bound on the number of idempotent MOLS of side \(n\) / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1002/JCD.21331 / rank
 
Normal rank

Latest revision as of 02:02, 20 December 2024

scientific article
Language Label Description Also known as
English
Cops and Robbers on Graphs Based on Designs
scientific article

    Statements

    Cops and Robbers on Graphs Based on Designs (English)
    0 references
    0 references
    0 references
    26 November 2013
    0 references
    cops and robbers
    0 references
    cop number
    0 references
    incidence graphs
    0 references
    polarity graphs
    0 references
    projective planes
    0 references
    group divisible designs
    0 references
    \(G\)-designs
    0 references
    block intersection graphs
    0 references
    point graphs
    0 references
    partial geometries
    0 references

    Identifiers

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