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!
|
| _version_ | 1849401549030162432 |
|---|---|
| author | Pongpat Sittitrai Wannapol Pimpasalee |
| author_facet | Pongpat Sittitrai Wannapol Pimpasalee |
| author_sort | Pongpat Sittitrai |
| collection | DOAJ |
| description | 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, as well as d1,d2-colorable. A class of planar graphs without C3,C4, and C6 is denoted by C. In 2019, Dross and Ochem proved that G is 0,6-colorable, for each graph G in C. Given that d1+d2≥6, this inspires us to investigate whether G is d1,d2-colorable, for each graph G in C. In this paper, we provide a partial solution by showing that G is (3, 3)-colorable, for each graph G in C. |
| format | Article |
| id | doaj-art-8d03e83214b34f69bbb5bd4247a9dcf6 |
| institution | Kabale University |
| issn | 1687-0425 |
| language | English |
| publishDate | 2024-01-01 |
| publisher | Wiley |
| record_format | Article |
| series | International Journal of Mathematics and Mathematical Sciences |
| spelling | doaj-art-8d03e83214b34f69bbb5bd4247a9dcf62025-08-20T03:37:44ZengWileyInternational Journal of Mathematics and Mathematical Sciences1687-04252024-01-01202410.1155/2024/7884281Planar Graphs without Cycles of Length 3, 4, and 6 are (3, 3)-ColorablePongpat Sittitrai0Wannapol Pimpasalee1Department of MathematicsDepartment of Science and MathematicsFor 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, as well as d1,d2-colorable. A class of planar graphs without C3,C4, and C6 is denoted by C. In 2019, Dross and Ochem proved that G is 0,6-colorable, for each graph G in C. Given that d1+d2≥6, this inspires us to investigate whether G is d1,d2-colorable, for each graph G in C. In this paper, we provide a partial solution by showing that G is (3, 3)-colorable, for each graph G in C.http://dx.doi.org/10.1155/2024/7884281 |
| spellingShingle | Pongpat Sittitrai Wannapol Pimpasalee Planar Graphs without Cycles of Length 3, 4, and 6 are (3, 3)-Colorable International Journal of Mathematics and Mathematical Sciences |
| title | Planar Graphs without Cycles of Length 3, 4, and 6 are (3, 3)-Colorable |
| title_full | Planar Graphs without Cycles of Length 3, 4, and 6 are (3, 3)-Colorable |
| title_fullStr | Planar Graphs without Cycles of Length 3, 4, and 6 are (3, 3)-Colorable |
| title_full_unstemmed | Planar Graphs without Cycles of Length 3, 4, and 6 are (3, 3)-Colorable |
| title_short | Planar Graphs without Cycles of Length 3, 4, and 6 are (3, 3)-Colorable |
| title_sort | planar graphs without cycles of length 3 4 and 6 are 3 3 colorable |
| url | http://dx.doi.org/10.1155/2024/7884281 |
| work_keys_str_mv | AT pongpatsittitrai planargraphswithoutcyclesoflength34and6are33colorable AT wannapolpimpasalee planargraphswithoutcyclesoflength34and6are33colorable |