Applications of graph coloring

Authors:
Ünal Ufuktepe;Goksen Bacak
Affiliations:
Department of Mathematics, Izmir Institute of Technology, Izmir, Urla, Turkey;Department of Mathematics, Izmir Institute of Technology, Izmir, Urla, Turkey
Venue:
ICCSA'05 Proceedings of the 2005 international conference on Computational Science and Its Applications - Volume Part III
Year:
2005

Citing 5
Cited 0

Implementing discrete mathematics: combinatorics and graph theory with Mathematica

Implementing discrete mathematics: combinatorics and graph theory with Mathematica
Graphs: theory and algorithms

Graphs: theory and algorithms
Graph theory and its applications

Graph theory and its applications
The Mathematica Book

The Mathematica Book
Computational Discrete Mathematics: Combinatorics and Graph Theory with Mathematica ®

Computational Discrete Mathematics: Combinatorics and Graph Theory with Mathematica ®

Quantified Score

Hi-index	0.00

Visualization

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.