- All Volumes
- Volume 33, issue 1, 2023 (5 papers)
- Volume 32, Issue 1, 2022 (6 papers)
- Volume 32, Issue 2, 2022 (5 papers)
- Volume 31, Issue 1, 2021 (6 papers)
- Volume 31, Issue 2, 2021 (6 papers)
- Volume 30, Issue 1, 2020 (7 papers)
- Volume 30, Issue 2, 2020 (6 papers)
- Volume 29, Issue 1, 2019 (6 papers)
- Volume 29, Issue 2, 2019 (6 papers)
- Volume 21, Issue 1, 2014 (12 papers)
- Volume 16, Issue 1, 2012 (10 papers)
- Volume 19, Issue 2, 2012 (13 papers)
- Volume 20, Issue 3, 2012 (13 papers)
- Volume 14, Issue 2, 2011 (10 papers)
- Volume 12, Issue1, 2010 (16 papers)
Views : 260 Downloads : 193 Download PDF
Equitable Total Coloring of Goldbers Snarks and its Related graphs
Corresponding Author : Kh. Md. Mominul Haque (momin66@gmail.com)
Authors : Kh. Md. Mominul Haque (momin66@gmail.com), Umme Nasreen Khanam
Keywords : Equitable total coloring, Equitable total chromatic number, Goldberg snark
Abstract :
The equitable total chromatic number of a graph G is the smallest integer k for which G has k
total coloring such that the number of vertices and edges colored with each color differ by at
most one. In this paper, we show that Goldberg snarks and its related graphs have equitable
total 4-coloring.
Published on June 30th, 2010 in Volume 12, Issue1, Applied Sciences and Technology