Bhargava, S. and Adiga, C. and Somashekara, D. D. (1993) Three-square theorem as an application of Andrews' identity. Fibonacci Quarterly, 31 (2). pp. 129-133.
![[img]](http://eprints.uni-mysore.ac.in/style/images/fileicons/text.png) |
Text
Three-square theorem as an application of Andrews' identity.pdf Restricted to Registered users only Download (1MB) | Request a copy |
Abstract
For a graph G=G(V,E), a set S⊂V is k-independent if every component in the induced subgraph on S has order at most k−1. The general chromatic number χk(G) of G is the minimum order n of a partition P of the set V such that each set Vi in P is k-independent. This paper develops properties of χk(G) which generalize well-known properties of the chromatic number. Kk+1-free graphs G with χk(G)=n are constructed, and critical and minimal graphs are explored.
| Item Type: | Article |
|---|---|
| Subjects: | E Mathematical Science > Mathematics |
| Divisions: | Department of > Mathematics |
| Depositing User: | Users 23 not found. |
| Date Deposited: | 05 May 2021 05:23 |
| Last Modified: | 08 Jul 2022 07:39 |
| URI: | http://eprints.uni-mysore.ac.in/id/eprint/16313 |
Actions (login required)
 |
View Item |
