Pakistan Science Abstracts
Choose Theme
1
2
3
4
Theme 1
— Green & Gold
Print
Save as PDF
Export BibTeX
Close
No Detail Found!
Home
›
Discrete Mathematics Letters
Restricted coloring of 1-by-n chessboards
Author(s)
Ronit Mansour
AL-Qasemi Academy, (R.A)-Academic College of Education,Baqa-El-Gharbia,Israel
Amal Sharif-Rasslan
Department of Mathematics, Academic Arab College,Haifa,Israel
Abstract
In this note, we answer the following question: in how many ways one can color a 1 n chessboard using colors from the set f1; 2; : : : ; mg such that the color i occurs a multiple of ti number of times for all i = 1; 2; : : : ; m?.
Publication Details
Page(s)
90-93
DOI
10.47443/dml.2021.0068
Published
Journal: Discrete Mathematics Letters, Volume: 7, Issue: 0, Year: 2021
Request the full text from PASTIC
Keywords
coloring chessboard, Generating Function
References
Beresin M.,Levine E.,Winn J.,Brualdi R. A.,Abboud E.,Saleh F.,Sharif-Rasslan A. .2019 .Coloring a 1-by-n chessboard. Introductory Combinatorics, 2nd Edition, 50 : 322-330.
More from
Discrete Mathematics Letters
The average domination polynomial of graphs is unimodal
Perfect Roman domination in middle graphs
An asymptotic relation between the wirelength of an embedding and the Wiener index
Vertex identification in trees
On the non-existence of Abelian Moore Cayley graphs with excess one
0
Citations
0
Downloads
13
Views