λd,1-Minimal trees and full colorability of some classes of graphs

Bibliographic Details
Published:	2009
Subjects:	Trees (Graph theory) Graph coloring
Online Access:	http://hdl.handle.net/10210/2465

id	ndltd-netd.ac.za-oai-union.ndltd.org-uj-uj-8339
record_format	oai_dc
spelling	ndltd-netd.ac.za-oai-union.ndltd.org-uj-uj-83392016-08-16T03:58:18Zλd,1-Minimal trees and full colorability of some classes of graphsTrees (Graph theory)Graph coloring2009-04-30T09:32:31ZThesisuj:8339http://hdl.handle.net/10210/2465
collection	NDLTD
sources	NDLTD
topic	Trees (Graph theory) Graph coloring
spellingShingle	Trees (Graph theory) Graph coloring λd,1-Minimal trees and full colorability of some classes of graphs
title	λd,1-Minimal trees and full colorability of some classes of graphs
title_short	λd,1-Minimal trees and full colorability of some classes of graphs
title_full	λd,1-Minimal trees and full colorability of some classes of graphs
title_fullStr	λd,1-Minimal trees and full colorability of some classes of graphs
title_full_unstemmed	λd,1-Minimal trees and full colorability of some classes of graphs
title_sort	λd,1-minimal trees and full colorability of some classes of graphs
publishDate	2009
url	http://hdl.handle.net/10210/2465
_version_	1718377578999316480

Similar Items