Some bounds on local connective chromatic number
Graph coloring is one of the most important concept in graph theory. Many practical problems can be formulated as graph coloring problems. In this paper, we define a new coloring concept called local connective coloring. A local connective k-coloring of a graph G is a proper vertex coloring, which a...
| Main Authors: | , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
BİSKA Bilisim Company
2017-08-01
|
| Series: | New Trends in Mathematical Sciences |
| Subjects: | |
| Online Access: | https://ntmsci.com/ajaxtool/GetArticleByPublishedArticleId?PublishedArticleId=8292 |