Applications of Graph Coloring
Loading...
Files
Date
Authors
Ufuktepe, Ünal
Journal Title
Journal ISSN
Volume Title
Publisher
Open Access Color
Green Open Access
Yes
OpenAIRE Downloads
OpenAIRE Views
Publicly Funded
No
BIP! Indicators
Impulse
Average
Influence
Average
Popularity
Average
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
Keywords
Computational methods, Computer applications, Hamiltonians, Mathematical techniques, Computational science, Eulerian cycles, Graph coloring, Hamiltonian cycles, Graph theory, Hamiltonians, Graph theory, Eulerian cycles, Computational science, Computational methods, Computer applications, Mathematical techniques, Graph coloring, Hamiltonian cycles
Fields of Science
0102 computer and information sciences, 0101 mathematics, 01 natural sciences
Citation
Ufuktepe, Ü., and Bacak, G. (2005). Applications of graph coloring. Lecture Notes in Computer Science, 3482(III), 522-528. doi:10.1007/11424857_55
WoS Q
Scopus Q
OpenCitations Citation Count
2
Volume
3482
Issue
III
Start Page
522
End Page
528
PlumX Metrics
Citations
CrossRef : 1
Scopus : 2
Captures
Mendeley Readers : 11
SCOPUS™ Citations
2
checked on Apr 28, 2026
Web of Science™ Citations
1
checked on Apr 28, 2026
Page Views
806
checked on Apr 28, 2026
Downloads
705
checked on Apr 28, 2026
Google Scholar™
