Zobrazeno 1 - 10
of 197
pro vyhledávání: '"Sittitrai P"'
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
Autor:
Sittitrai Pongpat, Nakprasit Kittikorn
Publikováno v:
Discussiones Mathematicae Graph Theory, Vol 42, Iss 1, Pp 89-99 (2022)
A graph G is list vertex k-arborable if for every k-assignment L, one can choose f(v) ∈ L(v) for each vertex v so that vertices with the same color induce a forest. In [6], Borodin and Ivanova proved that every planar graph without 4-cycles adjacen
Externí odkaz:
https://doaj.org/article/22bf29d2214f4f3f81cf2cf5045ffe52
Publikováno v:
BMC Oral Health, Vol 24, Iss 1, Pp 1-12 (2024)
Abstract Background This retrospective study aims to compare the oncological and functional outcomes of the submental island flap versus the radial forearm free flap used for oral cavity cancer reconstruction after minimizing differences in baseline
Externí odkaz:
https://doaj.org/article/5ae7b52dbd814e9b96499a0be4f86afa
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
Autor:
Roongroj Bhidayasiri, Jirada Sringean, Saisamorn Phumphid, Chanawat Anan, Chusak Thanawattano, Suwijak Deoisres, Pattamon Panyakaew, Onanong Phokaewvarangkul, Suppata Maytharakcheep, Vijittra Buranasrikul, Tittaya Prasertpan, Rotjana Khontong, Priya Jagota, Araya Chaisongkram, Worawit Jankate, Jeeranun Meesri, Araya Chantadunga, Piyaporn Rattanajun, Phantakarn Sutaphan, Weerachai Jitpugdee, Marisa Chokpatcharavate, Yingyos Avihingsanon, Chanchai Sittipunt, Werasit Sittitrai, Grisada Boonrach, Aekamorn Phonsrithong, Pichit Suvanprakorn, Janprapa Vichitcholchai, Tej Bunnag
Publikováno v:
Frontiers in Neurology, Vol 15 (2024)
The rising prevalence of Parkinson’s disease (PD) globally presents a significant public health challenge for national healthcare systems, particularly in low-to-middle income countries, such as Thailand, which may have insufficient resources to me
Externí odkaz:
https://doaj.org/article/430a541498e340e3bc455d2e00154b21
Autor:
Pongpat Sittitrai, Wannapol Pimpasalee
Publikováno v:
International Journal of Mathematics and Mathematical Sciences, Vol 2024 (2024)
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 t
Externí odkaz:
https://doaj.org/article/8d03e83214b34f69bbb5bd4247a9dcf6
Akademický článek
Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.
K zobrazení výsledku je třeba se přihlásit.
Akademický článek
Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.
K zobrazení výsledku je třeba se přihlásit.
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
Akademický článek
Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.
K zobrazení výsledku je třeba se přihlásit.