| Conţinutul numărului revistei |
| Articolul precedent |
| Articolul urmator |
 |
 1022 3 |
| Ultima descărcare din IBN: 2017-04-28 21:21 |
| Căutarea după subiecte similare conform CZU |
| 004:519.179.1 (2) |
| Știința și tehnologia calculatoarelor. Calculatoare. Procesarea datelor (4191) |
| Analiză combinatorică. Teoria grafurilor (115) |
 SM ISO690:2012GIONFRIDDO, Mario, AMATO, Alberto. An edge colouring of multigraphs. In: Computer Science Journal of Moldova, 2007, nr. 2(44), pp. 212-216. ISSN 1561-4042. |
| EXPORT metadate: Google Scholar Crossref CERIF DataCite Dublin Core |
 Computer Science Journal of Moldova |
||||||
| Numărul 2(44) / 2007 / ISSN 1561-4042 /ISSNe 2587-4330 | ||||||
|
||||||
| CZU: 004:519.179.1 | ||||||
| Pag. 212-216 | ||||||
|
||||||
 Descarcă PDF |
||||||
| Rezumat | ||||||
We consider a strict k-colouring of a multigraph G as a surjection f from the vertex set of G into a set of colours f1,2,. . . ,kg
such that, for every non-pendant vertex x of G, there exist at
least two edges incident to x and coloured by the same colour.
The maximum number of colours in a strict edge colouring of G
is called the upper chromatic index of G and is denoted by Â(G).
In this paper we prove some results about it. |
||||||
|
Dublin Core Export
<?xml version='1.0' encoding='utf-8'?> <oai_dc:dc xmlns:dc='http://purl.org/dc/elements/1.1/' xmlns:oai_dc='http://www.openarchives.org/OAI/2.0/oai_dc/' xmlns:xsi='http://www.w3.org/2001/XMLSchema-instance' xsi:schemaLocation='http://www.openarchives.org/OAI/2.0/oai_dc/ http://www.openarchives.org/OAI/2.0/oai_dc.xsd'> <dc:creator>Gionfriddo, M.</dc:creator> <dc:creator>Amato, A.</dc:creator> <dc:date>2007-01-05</dc:date> <dc:description xml:lang='en'>We consider a strict k-colouring of a multigraph G as a surjection f from the vertex set of G into a set of colours f1,2,. . . ,kg such that, for every non-pendant vertex x of G, there exist at least two edges incident to x and coloured by the same colour. The maximum number of colours in a strict edge colouring of G is called the upper chromatic index of G and is denoted by Â(G). In this paper we prove some results about it.</dc:description> <dc:source>Computer Science Journal of Moldova 44 (2) 212-216</dc:source> <dc:title>An edge colouring of multigraphs</dc:title> <dc:type>info:eu-repo/semantics/article</dc:type> </oai_dc:dc>
|
|
|
