Artykuł  

Equitable coloring of graph products

creativeworkseries.issn1232-9274
dc.contributor.authorFurmańczyk, Hanna
dc.date.issued2006
dc.description.abstractA graph is equitably k-colorable if its vertices can be partitioned into k independent sets in such a way that the number of vertices in any two sets differ by at most one. The smallest k for which such a coloring exists is known as the "equitable chromatic number" of G and denoted by χ=(G). It is interesting to note that if a graph G is equitably k-colorable, it does not imply that it is equitably (k + 1)-colorable. The smallest integer k for which G is equitably k'-colorable for all k' ≥ k is called "the equitable chromatic threshold" of G and denoted by χ*=(G). In the paper we establish the equitable chromatic number and the equitable chromatic threshold for certain products of some highly-structured graphs. We extend the results from [2] for Cartesian, weak and strong tensor products.en
dc.description.versionwersja wydawnicza
dc.identifier.eissn2300-6919
dc.identifier.issn1232-9274
dc.identifier.nukatdd2007318017
dc.identifier.urihttps://repo.agh.edu.pl/handle/AGH/49961
dc.language.isoeng
dc.rightsAttribution 4.0 International
dc.rights.accessotwarty dostęp
dc.rights.urihttps://creativecommons.org/licenses/by/4.0/legalcode
dc.subjectequitable coloringen
dc.subjectgraph producten
dc.titleEquitable coloring of graph productsen
dc.title.relatedOpuscula Mathematica
dc.typeartykuł
dspace.entity.typePublication
publicationissue.issueNumberNo. 1
publicationissue.paginationpp. 31-44
publicationvolume.volumeNumberVol. 26
relation.isJournalIssueOfPublication230fd3db-deb9-4fc1-807e-96fcbd9d41fe
relation.isJournalIssueOfPublication.latestForDiscovery230fd3db-deb9-4fc1-807e-96fcbd9d41fe
relation.isJournalOfPublication304b3b9b-59b9-4830-9178-93a77e6afbc7
Pliki
Pakiet podstawowy
Teraz pokazywane1 - 1 z 1
Ładuję...
Miniatura
Nazwa:
26-1-03.pdf
Rozmiar:
214.54 KB
Format:
Adobe Portable Document Format
Opis:
Artykuł z czasopisma