Applications of Graph Coloring
| dc.contributor.author | Ufuktepe, Ünal | |
| dc.contributor.author | Bacak, Gökşen | |
| dc.coverage.doi | 10.1007/11424857_55 | |
| dc.date.accessioned | 2016-07-22T13:11:45Z | |
| dc.date.available | 2016-07-22T13:11:45Z | |
| dc.date.issued | 2005 | |
| dc.description | International Conference on Computational Science and Its Applications - ICCSA 2005; 9 May 2005 through 12 May 2005 | en_US |
| dc.description.abstract | A graph G is a mathematical structure consisting of two sets V(G) (vertices of G) and E(G) (edges of G). Proper coloring of a graph is an assignment of colors either to the vertices of the graphs, or to the edges, in such a way that adjacent vertices / edges are colored differently. This paper discusses coloring and operations on graphs with Mathematica and webMathematica. We consider many classes of graphs to color with applications. We draw any graph and also try to show whether it has an Eulerian and Hamiltonian cycles by using our package ColorG | en_US |
| dc.identifier.citation | Ufuktepe, Ü., and Bacak, G. (2005). Applications of graph coloring. Lecture Notes in Computer Science, 3482(III), 522-528. doi:10.1007/11424857_55 | en_US |
| dc.identifier.doi | 10.1007/11424857_55 | en_US |
| dc.identifier.doi | 10.1007/11424857_55 | |
| dc.identifier.issn | 0302-9743 | |
| dc.identifier.issn | 1611-3349 | |
| dc.identifier.issn | 0302-9743 | |
| dc.identifier.scopus | 2-s2.0-24944472323 | |
| dc.identifier.uri | http://doi.org/10.1007/11424857_55 | |
| dc.identifier.uri | https://hdl.handle.net/11147/1977 | |
| dc.language.iso | en | en_US |
| dc.publisher | Springer Verlag | en_US |
| dc.relation.ispartof | Lecture Notes in Computer Science | en_US |
| dc.rights | info:eu-repo/semantics/openAccess | en_US |
| dc.subject | Computational methods | en_US |
| dc.subject | Computer applications | en_US |
| dc.subject | Hamiltonians | en_US |
| dc.subject | Mathematical techniques | en_US |
| dc.subject | Computational science | en_US |
| dc.subject | Eulerian cycles | en_US |
| dc.subject | Graph coloring | en_US |
| dc.subject | Hamiltonian cycles | en_US |
| dc.subject | Graph theory | en_US |
| dc.title | Applications of Graph Coloring | en_US |
| dc.type | Conference Object | en_US |
| dspace.entity.type | Publication | |
| gdc.author.institutional | Ufuktepe, Ünal | |
| gdc.author.institutional | Bacak, Gökşen | |
| gdc.author.yokid | 24823 | |
| gdc.author.yokid | 109885 | |
| gdc.bip.impulseclass | C5 | |
| gdc.bip.influenceclass | C5 | |
| gdc.bip.popularityclass | C5 | |
| gdc.coar.access | open access | |
| gdc.coar.type | text::conference output | |
| gdc.collaboration.industrial | false | |
| gdc.description.department | İzmir Institute of Technology. Mathematics | en_US |
| gdc.description.endpage | 528 | en_US |
| gdc.description.issue | III | en_US |
| gdc.description.publicationcategory | Konferans Öğesi - Uluslararası - Kurum Öğretim Elemanı | en_US |
| gdc.description.scopusquality | Q3 | |
| gdc.description.startpage | 522 | en_US |
| gdc.description.volume | 3482 | en_US |
| gdc.description.wosquality | N/A | |
| gdc.identifier.openalex | W51158184 | |
| gdc.identifier.wos | WOS:000229696900055 | |
| gdc.index.type | WoS | |
| gdc.index.type | Scopus | |
| gdc.oaire.diamondjournal | false | |
| gdc.oaire.impulse | 0.0 | |
| gdc.oaire.influence | 2.7613773E-9 | |
| gdc.oaire.isgreen | true | |
| gdc.oaire.keywords | Hamiltonians | |
| gdc.oaire.keywords | Graph theory | |
| gdc.oaire.keywords | Eulerian cycles | |
| gdc.oaire.keywords | Computational science | |
| gdc.oaire.keywords | Computational methods | |
| gdc.oaire.keywords | Computer applications | |
| gdc.oaire.keywords | Mathematical techniques | |
| gdc.oaire.keywords | Graph coloring | |
| gdc.oaire.keywords | Hamiltonian cycles | |
| gdc.oaire.popularity | 1.3265515E-9 | |
| gdc.oaire.publicfunded | false | |
| gdc.oaire.sciencefields | 0102 computer and information sciences | |
| gdc.oaire.sciencefields | 0101 mathematics | |
| gdc.oaire.sciencefields | 01 natural sciences | |
| gdc.openalex.collaboration | National | |
| gdc.openalex.fwci | 0.0 | |
| gdc.openalex.normalizedpercentile | 0.01 | |
| gdc.opencitations.count | 2 | |
| gdc.plumx.crossrefcites | 1 | |
| gdc.plumx.mendeley | 11 | |
| gdc.plumx.scopuscites | 2 | |
| gdc.scopus.citedcount | 2 | |
| gdc.wos.citedcount | 1 | |
| relation.isAuthorOfPublication.latestForDiscovery | ace8c4bc-a9c0-4e2a-ad92-c81e6d9e85c3 | |
| relation.isOrgUnitOfPublication.latestForDiscovery | 9af2b05f-28ac-4012-8abe-a4dfe192da5e |