On total and entire weightings of plane graphs and some special classes of graphs
Date of Publication
Bachelor of Science in Mathematics with specialization in Business Applications
College of Science
Mathematics and Statistics Department
This study discusses some results on entire weightings of plane graphs which induce proper vertex or proper face colorings. Specifically, entire weightings of 2-connected plane graphs are studied, and the minimum number of weights that make possible these proper vertex or face colorings are identified. This study also looks at total weightings of some classes of graphs which induce a proper vertex coloring. In particular, the minimum number of weights that can be used to generate a proper vertex coloring and graphs which admit a proper vertex coloring total weighting that uses at most two weights will be investigated. Most of the results in this paper are based on  and .
Archives, The Learning Commons, 12F, Henry Sy Sr. Hall
1 computer disc ; 4 3/4 in.
Ilagan, M. M., & Velilla, J. L. (2016). On total and entire weightings of plane graphs and some special classes of graphs. Retrieved from https://animorepository.dlsu.edu.ph/etd_bachelors/14907