Planar Graphs without Cycles of Length 3, 4, and 6 are (3, 3)-Colorable
For non-negative integers d1 and d2, if V1 and V2 are two partitions of a graph G’s vertex set VG, such that V1 and V2 induce two subgraphs of G, called GV1 with maximum degree at most d1 and GV2 with maximum degree at most d2, respectively, then the graph G is said to be improper d1,d2-colorable, a...
Saved in:
| Main Authors: | , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Wiley
2024-01-01
|
| Series: | International Journal of Mathematics and Mathematical Sciences |
| Online Access: | http://dx.doi.org/10.1155/2024/7884281 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|