WAHYU SULISTIYORINI, ERFA
(2013)
*PEWARNAAN PADA DIGRAF.*
Other thesis, University of Muhammadiyah Malang.

## Abstract

Graph theory is a branch of mathematics that is currently growing and attractive because of its uniqueness. The uniqueness of graph theory is the simplicity of the subject to learn, because it can be served as a vertex and edge. On its use, a graph can be colored. Discussing the coloring of graph, it will not be separated from how to determine the minimum number of colors that can be used to color a graph. In determining the chromatic number of a graph, it can use some coloring algorithms as like Greedy algorithms. One of the type of graph which is very well known in graph theory is a planar graph. On graph theory, there are two types of graphs, namely undirected graph and directed graph which is usually called digraphs. In the subject of coloring on the undirected graph, it has often discussed in the various studies of mathematics. However, there are few people discussing about the study on the coloring of digraphs. Thus, this study will discuses on how the coloring process on planar digraphs by using Greedy algorithms. After that, the next step is how to determine the chromatic number on edge coloring planar digraphs by using Greedy algorithms. Edge directed coloring of a digraph provides a different color on the edge of the neighboring directional (with the same out-degrees), so that there are not two edges having the same color trending. The important thing to know is the coloring digraphs, only the edge of the out direction that must be considered. To find the minimum amount of chromatic number at a planar digraph, it can be solved by looking at the maximum of out-degree of the digraph. Mathematically represented as follows

Item Type: | Thesis (Other) |
---|---|

Subjects: | Q Science > QA Mathematics |

Divisions: | Faculty of Teacher Training and Education > Department of Mathematics and Computing |

Depositing User: | Gusti Vani Putri Cahya |

Date Deposited: | 06 Feb 2015 03:16 |

Last Modified: | 06 Feb 2015 03:16 |

URI : | http://eprints.umm.ac.id/id/eprint/15735 |

### Actions (login required)

View Item |