The total game chromatic number of paths, cycles and stars
- Title
- The total game chromatic number of paths, cycles and stars
- Creator
- Bharadwaj H.; Mangam T.A.
- Description
- The total game coloring is one of the extensions of the game coloring problem in which two players alternatively color both vertices and edges of a given graph. In this paper, the total game chromatic number is determined for the classes of paths, cycles, and stars. The incidence game chromatic number for large paths is also discussed by relating the incidence and the total graphs of paths. 2022 Forum-Editrice Universitaria Udinese SRL. All rights reserved.
- Source
- Italian Journal of Pure and Applied Mathematics, Vol-47, pp. 303-311.
- Date
- 2022-01-01
- Publisher
- Forum-Editrice Universitaria Udinese SRL
- Subject
- game coloring; total coloring
- Coverage
- Bharadwaj H., Department of Mathematics, CHRIST (Deemed to be University), Karnataka, Bengaluru, India; Mangam T.A., Department of Mathematics, CHRIST (Deemed to be University), Karnataka, Bengaluru, India
- Rights
- Restricted Access
- Relation
- ISSN: 11268042
- Format
- Online
- Language
- English
- Type
- Article
Collection
Citation
Bharadwaj H.; Mangam T.A., “The total game chromatic number of paths, cycles and stars,” CHRIST (Deemed To Be University) Institutional Repository, accessed February 25, 2025, https://archives.christuniversity.in/items/show/15425.