@article{Mahmudah_2018, title={Graph Staining Application against Chemical Storage}, volume={3}, url={https://ejurnal.uij.ac.id/index.php/AXI/article/view/308}, abstractNote={<p><em>Graf G = (V, E), where V is the set of points and E is the set of sides. Interesting application of a graph, one of which is graph coloring (graph coloring). There are three kinds of coloring that </em><em>are</em><em> point</em><em> coloring</em><em>, </em><em>edge coloring</em><em>, and region</em><em> coloring</em><em>. In this paper will be studied dye staining. Point </em><em>coloring</em><em> is to color the dots of a graph so that no two neighboring dots have the same color. The minimum number of colors that can be used to color graph is expressed by chromatic numbers. Currently a lot of applications from graph coloring, one of which is the storage of chemicals. In the storage of chemicals required a good arrangement, this is due to the influence of chemicals with each other if stored simultaneously.The main focus of this paper is to determine the chromatic number in graph o and the application scheme of dye graph coloring.</em><em></em></p><p><strong><em>K</em></strong><strong><em>eywords</em></strong>:<strong> </strong><em>graph coloring, point coloring, edge coloring and</em> <em>region</em><em> coloring</em><strong></strong></p>}, number={1}, journal={Jurnal Axioma : Jurnal Matematika dan Pembelajaran}, author={Mahmudah, Muhlisatul}, year={2018}, month={Jan.}, pages={45–50} }