Copnumber of graphs with strong isometric dimension two

Ars Combinatoria

Volumn 59, Issue , 2001, Pages 65-73

  Fitzpatrick, Shannon L ^a   Nowakowski, Richard J ^b  

^a ACADIA UNIVERSITY   (Canada)

^b DALHOUSIE UNIVERSITY   (Canada)

Author keywords

Embedding; Isometric; Paths; Strong product

Indexed keywords

EID: 0035320426     PISSN: 03817032     EISSN: 28175204     Source Type: Journal    
DOI: None     Document Type: Article

References (9)

1. M. Aigner & M. Fromme, A game of cops and robbers, Math. 8 (1984), 1-12.
2. T. Andreae, Note on a pursuit game played on graphs, Discrete Appl. Math. 9 (1984), 111-115.
3. T. Andreae, On a pursuit game played on graphs for which a minor is excluded, J. Combin. Theory Ser. B 41 (1986), 37-47.
4. S. L. Fitzpatrick & R. J. Nowakowski, The strong isometric dimension of finite reflexive graphs, to appear in Discussiones Mathematicae Graph Theory.
5. S. Neufeld & R. J. Nowakowski, Copnumbers of Cartesian, strong and categorical products of graphs, Discrete Math. 186 (1998), 253-268.
6. R. J. Nowakowski &, P. Winkler, Vertex to vertex pursuit in a graph, Discrete Math. 43 (1983), 235-239.
7. A. Quilliot, Thèse d'Etat, Université de Paris VI, 1983.
8. A. Quilliot, A short note about pursuit games played on a graph with a given genus, J. Combin. Theory (Ser. B) 38 (1985), 89-92.
9. J. Battle, F. Harary, Y. Kodama &, J. W. T. Youngs, Additivity of the genus of a graph, Bull. Amer. Math. Soc. 68 (1962), 565-568.