Please use this identifier to cite or link to this item:
https://hdl.handle.net/11147/1977| Title: | Applications of Graph Coloring | Authors: | Ufuktepe, Ünal Bacak, Gökşen |
Keywords: | Computational methods Computer applications Hamiltonians Mathematical techniques Computational science Eulerian cycles Graph coloring Hamiltonian cycles Graph theory |
Publisher: | Springer Verlag | Source: | Ufuktepe, Ü., and Bacak, G. (2005). Applications of graph coloring. Lecture Notes in Computer Science, 3482(III), 522-528. doi:10.1007/11424857_55 | Abstract: | A graph G is a mathematical structure consisting of two sets V(G) (vertices of G) and E(G) (edges of G). Proper coloring of a graph is an assignment of colors either to the vertices of the graphs, or to the edges, in such a way that adjacent vertices / edges are colored differently. This paper discusses coloring and operations on graphs with Mathematica and webMathematica. We consider many classes of graphs to color with applications. We draw any graph and also try to show whether it has an Eulerian and Hamiltonian cycles by using our package ColorG | Description: | International Conference on Computational Science and Its Applications - ICCSA 2005; 9 May 2005 through 12 May 2005 | URI: | http://doi.org/10.1007/11424857_55 http://hdl.handle.net/11147/1977 |
ISSN: | 0302-9743 1611-3349 0302-9743 |
| Appears in Collections: | Mathematics / Matematik Scopus İndeksli Yayınlar Koleksiyonu / Scopus Indexed Publications Collection WoS İndeksli Yayınlar Koleksiyonu / WoS Indexed Publications Collection |
Show full item record
CORE Recommender
SCOPUSTM
Citations
2
checked on Feb 28, 2025
WEB OF SCIENCETM
Citations
1
checked on Mar 1, 2025
Page view(s)
408
checked on Mar 3, 2025
Download(s)
832
checked on Mar 3, 2025
Google ScholarTM
Check
Altmetric
Items in GCRIS Repository are protected by copyright, with all rights reserved, unless otherwise indicated.