On the chromatic number of graphs with some restriction of vertex degrees
Graphs, for which the degree of a certain vertex is equal to (d + 1) and the degrees of all other vertices are at most d , d ≥ 3 , were considered. Properties were obtained to color vertices of these graphs in d colors.
Saved in:
| Main Author: | |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Kazan Federal University
2020-12-01
|
| Series: | Учёные записки Казанского университета: Серия Физико-математические науки |
| Subjects: | |
| Online Access: | https://kpfu.ru/uz-eng-phm-2020-4-1.html |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|