Zobrazeno 1 - 10
of 64
pro vyhledávání: '"Sittitrai, Pongpat"'
Partitioning planar graphs without 4-cycles and 6-cycles into a forest and a disjoint union of paths
In this paper, we show that every planar graph without $4$-cycles and $6$-cycles has a partition of its vertex set into two sets, where one set induces a forest, and the other induces a forest with maximum degree at most $2$ (equivalently, a disjoint
Externí odkaz:
http://arxiv.org/abs/2203.06466
Publikováno v:
In Discrete Applied Mathematics 30 October 2024 356:44-51
Publikováno v:
In Discrete Applied Mathematics 15 January 2024 342:347-354
Autor:
Sittitrai, Pongpat1 (AUTHOR), Pimpasalee, Wannapol2 (AUTHOR)
Publikováno v:
International Journal of Mathematics & Mathematical Sciences. 5/9/2024, Vol. 2054, p1-4. 4p.
DP-coloring (also known as correspondence coloring) is a generalization of list coloring developed recently by Dvorak and Postle. We introduce and study $(i,j)$-defective DP-colorings of multigraphs. We concentrate on sparse multigraphs and consider
Externí odkaz:
http://arxiv.org/abs/1912.03421
Xu and Wu proved that if every 5-cycle of a planar graph G is not simultaneously adjacent to 3-cycles and 4-cycles, then G is 4-choosable. In this paper, we improve this result as follows. If G is a planar graph without pairwise adjacent 3-,4-,5-, an
Externí odkaz:
http://arxiv.org/abs/1812.10473
Publikováno v:
Discussiones Mathematicae Graph Theory, Vol 43, Iss 1, Pp 287-297 (2023)
DP-coloring is generalized via relaxed coloring and variable degeneracy in [P. Sittitrai and K. Nakprasit, Su cient conditions on planar graphs to have a relaxed DP-3-coloring, Graphs Combin. 35 (2019) 837–845], [K.M. Nakprasit and K. Nakprasit, A
Externí odkaz:
https://doaj.org/article/78bc2d27db7a460b87a3902a2fa3e79d
Publikováno v:
Taiwanese Journal of Mathematics, 2021 Dec 01. 25(6), 1113-1135.
Externí odkaz:
https://www.jstor.org/stable/27096592
In \cite{listnoC3adjC4}), Borodin and Ivanova proved that every planar graph without $4$-cycles adjacent to $3$-cycle is list vertex-$2$-aborable. In fact, they proved a more general result. Inspired by these results and DP-coloring which becomes a w
Externí odkaz:
http://arxiv.org/abs/1807.00815
It is known that DP-coloring is a generalization of a list coloring in simple graphs and many results in list coloring can be generalized in those of DP-coloring. In this work, we introduce a relaxed DP-coloring which is a generalization if a relaxed
Externí odkaz:
http://arxiv.org/abs/1803.03527