Zobrazeno 1 - 2
of 2
pro vyhledávání: '"X−chromatic partition"'
Publikováno v:
Boletim da Sociedade Paranaense de Matemática, Vol 34, Iss 2, Pp 99-105 (2016)
Let G = (X, Y,E) be a bipartite graph. A X-dominating set D ⊆ X is called a X−dominating colour transversal set of a graph G if D is a transversal of at least one $chi$−partition of G.The minimum cardinal- ity of a X−dominating colour transve
Externí odkaz:
https://doaj.org/article/3214ac1e4c2242849da907a8e6bebd29
Publikováno v:
Boletim da Sociedade Paranaense de Matemática, Vol 34, Iss 2, Pp 99-105 (2016)
Let G = (X, Y,E) be a bipartite graph. A X-dominating set D ⊆X is called a X−dominating colour transversal set of a graph G if D isa transversal of at least one $chi$−partition of G.The minimum cardinal-ity of a X−dominating colour transversa
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::0e4e14f7418b0c593f17d52f18d23fe8
https://doi.org/10.5269/bspm.v34i2.22997
https://doi.org/10.5269/bspm.v34i2.22997