Edge coloring of a graph

Beşeri, Tina

Please use this identifier to cite or link to this item: https://hdl.handle.net/11147/3342

Full metadata record

DC Field	Value	Language
dc.contributor.advisor	Ufuktepe, Ünal	en
dc.contributor.author	Beşeri, Tina	-
dc.date.accessioned	2014-07-22T13:51:21Z	-
dc.date.available	2014-07-22T13:51:21Z	-
dc.date.issued	2004	en
dc.identifier.uri	http://hdl.handle.net/11147/3342	-
dc.description	Thesis (Master)--Izmir Institute of Technology, Mathematics, Izmir, 2004	en
dc.description	Includes bibliographical references (leaves: 35-36)	en
dc.description	Text in English; Abstract: Turkish and English	en
dc.description	viii, 36 leaves	en
dc.description.abstract	The edge coloring problem is one of the fundamental problem on graphs which often appears in various scheduling problems like the le transfer problem on computer networks. In this thesis, we survey old and new results on the classical edge coloring as well as the generalized edge coloring problems. In addition, we developed some algorithms and modules by using Combinatorica package to color the edges of graphs with webMathematica which is the new web-based technology.	en
dc.language.iso	en	en_US
dc.publisher	Izmir Institute of Technology	en
dc.rights	info:eu-repo/semantics/openAccess	en_US
dc.subject.lcc	QA166.247 .B55 2004	en
dc.subject.lcsh	Graph coloring	en
dc.subject.lcsh	Graph theory--Data processing	en
dc.subject.lcsh	Mathematica (Computer program language)	en
dc.title	Edge coloring of a graph	en_US
dc.type	Master Thesis	en_US
dc.institutionauthor	Beşeri, Tina	-
dc.department	Thesis (Master)--İzmir Institute of Technology, Mathematics	en_US
dc.relation.publicationcategory	Tez	en_US
item.fulltext	With Fulltext	-
item.grantfulltext	open	-
item.languageiso639-1	en	-
item.openairecristype	http://purl.org/coar/resource_type/c_18cf	-
item.cerifentitytype	Publications	-
item.openairetype	Master Thesis	-
Appears in Collections:	Master Degree / Yüksek Lisans Tezleri