000 01519nam a22005297a 4500
003 OSt
005 20251120105941.0
008 250819b |||||||| |||| 00| 0 eng d
040 _c
082 _aMAT2025
_bPhD / TD
100 _aZin Mar Myint
_b/MA20DP001
_eResearcher
245 _aA study on structural graph theory through combinatorial games
_h[PhD Thesis]
260 _aDharwad:
_bIndian Institute of Technology Dharwad,
_c©2025.
300 _avii, 151p. :
_bill. (col.) ;
_c30 cm (Hardbound)
504 _aIncludes bibliographical references.
653 _aGraph Theory, ,
653 _aStructural graph theory
653 _aCombinatorial games
653 _aImpartial game
653 _aPartisan game
653 _aSprouts
653 _aSprouts
653 _aimpartial game
653 _aSprague-Grundy values
653 _aplanar graph
653 _asurfaces
653 _aCops and Robber
653 _aOriented Graphs
653 _aRetracts
653 _aGeodetic set
653 _aMonitoring edge geodetic set
653 _ak-clique sum
653 _aSubdivisions
653 _aChromatic number
653 _aGirth
653 _aConnected graphs
653 _aDynamic graphs
653 _aTrees
653 _aGrid
653 _aGeodetic game
653 _aGeodetic Game
653 _aPolynomial-time algorithms
653 _aCartesian Product
700 _aSagnik sen
_eResearch Advisor
710 _aDepartment of Mathematics
942 _2ddc
_cTD
999 _c4752
_d4752