No public access
undergraduate thesis
Greedy Algorithms for graph vertex coloring

Marko Bukal (2016)
University of Zagreb
Faculty of Electrical Engineering and Computing
Cite this document...

Bukal, M. (2016). Pohlepni algoritmi za bojanje vrhova grafova (Undergraduate thesis). Retrieved from https://urn.nsk.hr/urn:nbn:hr:168:167262

Bukal, Marko. "Pohlepni algoritmi za bojanje vrhova grafova." Undergraduate thesis, University of Zagreb, Faculty of Electrical Engineering and Computing, 2016. https://urn.nsk.hr/urn:nbn:hr:168:167262

Bukal, Marko. "Pohlepni algoritmi za bojanje vrhova grafova." Undergraduate thesis, University of Zagreb, Faculty of Electrical Engineering and Computing, 2016. https://urn.nsk.hr/urn:nbn:hr:168:167262

Bukal, M. (2016). 'Pohlepni algoritmi za bojanje vrhova grafova', Undergraduate thesis, University of Zagreb, Faculty of Electrical Engineering and Computing, accessed 20 April 2019, https://urn.nsk.hr/urn:nbn:hr:168:167262

Bukal M. Pohlepni algoritmi za bojanje vrhova grafova [Undergraduate thesis]. Zagreb: University of Zagreb, Faculty of Electrical Engineering and Computing; 2016 [cited 2019 April 20] Available at: https://urn.nsk.hr/urn:nbn:hr:168:167262

M. Bukal, "Pohlepni algoritmi za bojanje vrhova grafova", Undergraduate thesis, University of Zagreb, Faculty of Electrical Engineering and Computing, Zagreb, 2016. Available at: https://urn.nsk.hr/urn:nbn:hr:168:167262