| Conţinutul numărului revistei |
| Articolul precedent |
| Articolul urmator |
 |
 434 5 |
| Ultima descărcare din IBN: 2023-02-19 12:33 |
| Căutarea după subiecte similare conform CZU |
| 519.17/.179 (1) |
| Analiză combinatorică. Teoria grafurilor (115) |
 SM ISO690:2012ALLAGAN, Julian-A., JONES, Kenneth L.. Chromatic Spectrum of Ks-WORM Colorings of Kn. In: Computer Science Journal of Moldova, 2020, nr. 2(83), pp. 170-186. ISSN 1561-4042. |
| EXPORT metadate: Google Scholar Crossref CERIF DataCite Dublin Core |
  Computer Science Journal of Moldova |
||||||
| Numărul 2(83) / 2020 / ISSN 1561-4042 /ISSNe 2587-4330 | ||||||
|
||||||
| CZU: 519.17/.179 | ||||||
| MSC 2010: 05C15, 05C30, 05C35, 05C65. | ||||||
| Pag. 170-186 | ||||||
|
||||||
 Descarcă PDF |
||||||
| Rezumat | ||||||
An H-WORM coloring of a simple graph G is the coloring of the vertices of G such that no copy of H b G is monochrome or rainbow. In a recently published article by one of the authors [3], it was claimed that the number of r-partitions in a Ks-WORM coloring of Kn is Cn r, where n r denotes the Stirling number of the second kind, for all 3 B r B s n. We found that Cn r if and only if n3 2 s B n with r s. Further investigations into 2, given any K3-WORM coloring of Kn, show its relation with the number of spanning trees of cacti and the Catalan numbers. Moreover, we extend the notion of H-WORM colorings to H1;H2-mixed colorings, where H1 and H2 are distinct subgraphs of G; these coloring constraints are closely related to those of mixed hypergraph colorings. |
||||||
| Cuvinte-cheie Catalan numbers, Chromatic spectrum, Mixed hypergraph coloring, Stirling numbers |
||||||
|
Cerif XML Export
<?xml version='1.0' encoding='utf-8'?> <CERIF xmlns='urn:xmlns:org:eurocris:cerif-1.5-1' xsi:schemaLocation='urn:xmlns:org:eurocris:cerif-1.5-1 http://www.eurocris.org/Uploads/Web%20pages/CERIF-1.5/CERIF_1.5_1.xsd' xmlns:xsi='http://www.w3.org/2001/XMLSchema-instance' release='1.5' date='2012-10-07' sourceDatabase='Output Profile'> <cfResPubl> <cfResPublId>ibn-ResPubl-110003</cfResPublId> <cfResPublDate>2020-09-11</cfResPublDate> <cfVol>83</cfVol> <cfIssue>2</cfIssue> <cfStartPage>170</cfStartPage> <cfISSN>1561-4042</cfISSN> <cfURI>https://ibn.idsi.md/ro/vizualizare_articol/110003</cfURI> <cfTitle cfLangCode='EN' cfTrans='o'>Chromatic Spectrum of Ks-WORM Colorings of Kn</cfTitle> <cfKeyw cfLangCode='EN' cfTrans='o'>Catalan numbers; Chromatic spectrum; Mixed hypergraph coloring; Stirling numbers</cfKeyw> <cfAbstr cfLangCode='EN' cfTrans='o'><p>An H-WORM coloring of a simple graph G is the coloring of the vertices of G such that no copy of H b G is monochrome or rainbow. In a recently published article by one of the authors [3], it was claimed that the number of r-partitions in a Ks-WORM coloring of Kn is C<sub>n</sub> r, where n r denotes the Stirling number of the second kind, for all 3 B r B s n. We found that C<sub>n</sub> r if and only if n3 2 s B n with r s. Further investigations into 2, given any K3-WORM coloring of Kn, show its relation with the number of spanning trees of cacti and the Catalan numbers. Moreover, we extend the notion of H-WORM colorings to H1;H2-mixed colorings, where H1 and H2 are distinct subgraphs of G; these coloring constraints are closely related to those of mixed hypergraph colorings.</p></cfAbstr> <cfResPubl_Class> <cfClassId>eda2d9e9-34c5-11e1-b86c-0800200c9a66</cfClassId> <cfClassSchemeId>759af938-34ae-11e1-b86c-0800200c9a66</cfClassSchemeId> <cfStartDate>2020-09-11T24:00:00</cfStartDate> </cfResPubl_Class> <cfResPubl_Class> <cfClassId>e601872f-4b7e-4d88-929f-7df027b226c9</cfClassId> <cfClassSchemeId>40e90e2f-446d-460a-98e5-5dce57550c48</cfClassSchemeId> <cfStartDate>2020-09-11T24:00:00</cfStartDate> </cfResPubl_Class> <cfPers_ResPubl> <cfPersId>ibn-person-29432</cfPersId> <cfClassId>49815870-1cfe-11e1-8bc2-0800200c9a66</cfClassId> <cfClassSchemeId>b7135ad0-1d00-11e1-8bc2-0800200c9a66</cfClassSchemeId> <cfStartDate>2020-09-11T24:00:00</cfStartDate> </cfPers_ResPubl> <cfPers_ResPubl> <cfPersId>ibn-person-80943</cfPersId> <cfClassId>49815870-1cfe-11e1-8bc2-0800200c9a66</cfClassId> <cfClassSchemeId>b7135ad0-1d00-11e1-8bc2-0800200c9a66</cfClassSchemeId> <cfStartDate>2020-09-11T24:00:00</cfStartDate> </cfPers_ResPubl> </cfResPubl> <cfPers> <cfPersId>ibn-Pers-29432</cfPersId> <cfPersName_Pers> <cfPersNameId>ibn-PersName-29432-3</cfPersNameId> <cfClassId>55f90543-d631-42eb-8d47-d8d9266cbb26</cfClassId> <cfClassSchemeId>7375609d-cfa6-45ce-a803-75de69abe21f</cfClassSchemeId> <cfStartDate>2020-09-11T24:00:00</cfStartDate> <cfFamilyNames>Allagan</cfFamilyNames> <cfFirstNames>Julian-A.</cfFirstNames> </cfPersName_Pers> </cfPers> <cfPers> <cfPersId>ibn-Pers-80943</cfPersId> <cfPersName_Pers> <cfPersNameId>ibn-PersName-80943-3</cfPersNameId> <cfClassId>55f90543-d631-42eb-8d47-d8d9266cbb26</cfClassId> <cfClassSchemeId>7375609d-cfa6-45ce-a803-75de69abe21f</cfClassSchemeId> <cfStartDate>2020-09-11T24:00:00</cfStartDate> <cfFamilyNames>Jones</cfFamilyNames> <cfFirstNames>Kenneth L.</cfFirstNames> </cfPersName_Pers> </cfPers> </CERIF>
|
|
|
