Characterizations of \(k\)-copwin graphs (Q408176): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: A game of cops and robbers / 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: Cops and robbers from a distance / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bridged graphs are cop-win graphs: An algorithmic proof / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Distance-Preserving and Domination Elimination Orderings / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4552216 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2770438 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Tandem version of the Cops and Robber Game played on products of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tandem-win graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A note on \(k\)-cop, \(l\)-robber games on graphs / rank
 
Normal rank

Latest revision as of 00:27, 5 July 2024

scientific article
Language Label Description Also known as
English
Characterizations of \(k\)-copwin graphs
scientific article

    Statements

    Identifiers