关注
William Klostermeyer
William Klostermeyer
Professor of Computer Science, University of North Florida
在 unf.edu 的电子邮件经过验证
标题
引用次数
引用次数
年份
Italian domination in trees
MA Henning, WF Klostermeyer
Discrete Applied Mathematics 217, 557-564, 2017
1202017
Eternal dominating sets in graphs
WF Klostermeyer, G MacGillivray
J. Combin. Math. Combin. Comput 68, 97-111, 2009
802009
Homomorphisms and oriented colorings of equivalence classes of oriented graphs
WF Klostermeyer, G MacGillivray
Discrete Mathematics 274 (1-3), 161-172, 2004
762004
Protecting a graph with mobile guards
WF Klostermeyer, CM Mynhardt
Applicable Analysis and Discrete Mathematics 10 (1), 1-29, 2016
682016
Secure domination and secure total domination in graphs
W Klostermeyer, C Mynhardt
Discussiones Mathematicae Graph Theory 28 (2), 267-284, 2008
652008
Characterizing switch-setting problems
J Goldwasser, W Klostermeyer, G Trapp
Linear and Multilinear algebra 43 (1-3), 121-135, 1997
651997
Tight bounds for eternal dominating sets in graphs
JL Goldwasser, WF Klostermeyer
Discrete Mathematics 308 (12), 2589-2593, 2008
602008
Maximization versions of" Lights Out" games in grids and graphs
J Goldwasser, W Klostermeyer
Congressus Numerantium, 99-112, 1997
541997
Perfect Roman domination in trees
MA Henning, WF Klostermeyer, G MacGillivray
Discrete Applied Mathematics 236, 235-245, 2018
522018
Fibonacci polynomials and parity domination in grid graphs
J Goldwasser, W Klostermeyer, H Ware
Graphs and Combinatorics 18, 271-283, 2002
492002
(2+ ϵ)‐Coloring of planar graphs with large odd‐girth
W Klostermeyer, CQ Zhang
Journal of Graph Theory 33 (2), 109-119, 2000
472000
Edge protection in graphs.
WF Klostermeyer, CM Mynhardt
Australas. J Comb. 45, 235-250, 2009
462009
Graphs with equal eternal vertex cover and eternal domination numbers
WF Klostermeyer, CM Mynhardt
Discrete Mathematics 311 (14), 1371-1379, 2011
452011
Analogues of cliques for oriented coloring
W Klostermeyer, G MacGillivray
Discussiones Mathematicae Graph Theory 24 (3), 373-387, 2004
402004
Eternal security in graphs of fixed independence number
WF Klostermeyer, G MacGillivray
Journal of Combinatorial Mathematics and Combinatorial Computing 63, 97, 2007
392007
Roman, Italian, and 2-domination
WF Klostermeyer, G MacGillivray
J. Combin. Math. Combin. Comput 108, 125-146, 2019
372019
Pushing vertices and orienting edges
WF Klostermeyer
ARS COMBINATORIA-WATERLOO THEN WINNIPEG- 51, 65-76, 1999
341999
The odd domination number of a graph
Y Caro, WF Klostermeyer
Journal of Combinatorial Mathematics and Combinatorial Computing 44, 65-84, 2003
292003
Eternal protection in grid graphs
J Goldwasser, WF Klostermeyer, CM Mynhardt
Util. Math 91, 47-64, 2013
262013
Eternal Total Domination in Graphs.
W Klostermeyer, CM Mynhardt
Ars Comb. 107, 473-492, 2012
262012
系统目前无法执行此操作,请稍后再试。
文章 1–20