Chromatic Polynomials Of Some (m,l)-Hyperwheels
In this paper, using a standard method of computing the chromatic polynomial of hypergraphs, we introduce a new reduction theorem which allows us to find explicit formulae for the chromatic polynomials of some (complete) non-uniform $(m,l)-$hyperwheels and non-uniform $(m,l)-$hyperfans. These hyper...
| Main Author: | |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Institute of Mathematics and Computer Science of the Academy of Sciences of Moldova
2014-03-01
|
| Series: | Computer Science Journal of Moldova |
| Subjects: | |
| Online Access: | http://www.math.md/files/csjm/v22-n1/v22-n1-(pp21-36).pdf |