Geodetic Achievement and Avoidance Games For Graphs

Author： Haynes Teresa W.   Henning Michael   Tiller Charlotte A.  

Publisher： Taylor & Francis Ltd

ISSN： 1607-3606

Source： Quaestiones Mathematicae, Vol.26, Iss.4, 2003-12, pp. : 389-397

Disclaimer: Any content in publications that violate the sovereignty, the constitution or regulations of the PRC is not accepted or approved by CNPIEC.

Previous Menu Next

Abstract

Related content

Stochastic games for distributed players on graphs

By Chornei Ruslan K.  

Mathematical Methods of Operations Research, Vol. 60, Iss. 2, 2004-10 ,pp. : 279-298

Springer Publishing Company

Access to resources Recommend Favorite

Maker‐breaker games on random geometric graphs

By  

RANDOM STRUCTURES AND ALGORITHMS, Vol. 45, Iss. 4, 2014-12 ,pp. : 553-607

John Wiley & Sons Inc

Access to resources Recommend Favorite

On the cores of games arising from integer edge covering functions of graphs

By Park Boram   Kim Suh-Ryung   Kim Hye  

Journal of Combinatorial Optimization, Vol. 26, Iss. 4, 2013-11 ,pp. : 786-798

Springer Publishing Company

Access to resources Recommend Favorite

Splitting graphs when calculating Myerson value for pure overhead games

By Gómez D.  

Mathematical Methods of Operations Research, Vol. 59, Iss. 3, 2004-07 ,pp. : 479-489

Springer Publishing Company

Access to resources Recommend Favorite

ON THE EDGE GEODETIC NUMBER OF A GRAPH

By ATICI M.  

International Journal of Computer Mathematics, Vol. 80, Iss. 7, 2003-07 ,pp. : 853-861

Taylor & Francis Ltd

Access to resources Recommend Favorite