Transactions on Transport Sciences 2013, 6(4):159-168 | DOI: 10.2478/v10158-012-0043-y

Circular Colouring for Emission Minimalization

R. Zewdie*,1, J. Hora1, Y. Nigussie2
1 Faculty of Engineering, Czech University of Life Sciences, Prague, Czech Republic
2 Department of Mathematics, East Tennessee State University, Johnson City, USA

The standard time allocation of classic road junctions in major towns and cities are often the main indicators of the government policy and management strategy in reducing traffic jams with its associated emission production from the traffic flow. In this paper, we apply the circular colouring method of Graph Theory (Vince, 1988; Zhu, 2001), to the emission reduction problem at a traffic road junction. The result of this paper is addressing this problem by optimizing the waiting time interval for two selected models. A traffic road junction is modelled as a finite graph G = (V, E). Each vertex v of G represents a given traffic light. Two vertices v and u are connected with an edge if their corresponding represented traffic flows collide and each time in such case they are given an overlapping green light time interval.

Keywords: Circular colouring, traffic flow, circular chromatic number.

Published: December 1, 2013  Show citation

ACS AIP APA ASA Harvard Chicago Chicago Notes IEEE ISO690 MLA NLM Turabian Vancouver
Zewdie, R., Hora, J., & Nigussie, Y. (2013). Circular Colouring for Emission Minimalization. Transactions on Transport Sciences, 6(4), 159-168. doi: 10.2478/v10158-012-0043-y
Share...
Download citation
  • BibTeX (.bib)
  • Bookends (.ris)
  • EasyBib (.ris)
  • EndNote (.enw)
  • EndNote 8 (.xml)
  • ISI WoS (.isi)
  • Medlars (.medlars)
  • Mendeley (.ris)
  • MODS (.xml)
  • Papers (.ris)
  • RefWorks (.txt)
  • RefManager (.ris)
  • RIS (.ris)
  • MS Word (.xml)
  • Zotero (.ris)
    • Open full article

    References

    1. Abbott, H. L, Zhou, B., 1993. The star chromatic number of a graph. Journal of Graph Theory, 17 (3), pp. 349-360. Go to original source...
    2. Mohar, B., 2001. Circular colouring of edge - weighted Graphs. Department of Mathematics, University of Ljubljana.
    3. Vince, A., 1988. Star chromatic number. Journal of Graph Theory, 12 (4), pp. 551-559. Go to original source...
    4. West, D. B., 1996. Introduction to Graph Theory. Prentice Hall.
    5. Zhu, X., 2001. Circular chromatic number: a survey. Discrete Mathematics, 229, pp. 371-410. Go to original source...

    This is an open access article distributed under the terms of the Creative Commons Attribution 4.0 International License (CC BY 4.0), which permits use, distribution, and reproduction in any medium, provided the original publication is properly cited. No use, distribution or reproduction is permitted which does not comply with these terms.


    Return to the content