Planar Graphs without Cycles of Length 3, 4, and 6 are (3, 3)-Colorable von Sittitrai, Pongpat, Pimpasalee, Wannapol

Volltext

An Analogue of DP-Coloring for Variable Degeneracy and its Applications von Sittitrai, Pongpat, Nakprasit, Kittikorn

Volltext

Every Planar Graph Without Pairwise Adjacent 3-, 4-, and 5-Cycle is DP-4-Colorable von Sittitrai, Pongpat, Nakprasit, Kittikorn

Volltext

A Weak DP-Partitioning of Planar Graphs without 4-Cycles and 6-Cycles von Sittitrai, Pongpat, Nakprasit, Keaitsuda Maneeruk, Nakprasit, Kittikorn

Volltext

Relaxed DP-Coloring and another Generalization of DP-Coloring on Planar Graphs without 4-Cycles and 7-Cycles von Sribunhung, Sarawute, Nakprasit, Keaitsuda Maneeruk, Nakprasit, Kittikorn, Sittitrai, Pongpat

Volltext

Sufficient Conditions of 6-Cycles Make Planar Graphs DP-4-Colorable von Nakprasit, Kittikorn, Ruksasakchai, Watcharintorn, Sittitrai, Pongpat

Volltext

Planar graphs without mutually adjacent 3-, 5-, and 6-cycles are 3-degenerate von Sittitrai, Pongpat, Nakprasit, Kittikorn

Volltext

Sufficient Conditions make Graphs Edge DP-Δ-Colorable von Ruksasakchai, Watcharintorn, Sittitrai, Pongpat

Volltext

Sufficient conditions for planar graphs without 4-cycles and 5-cycles to be 2-degenerate von Sittitrai, Pongpat, Nakprasit, Kittikorn

Volltext

Planar Graphs Without Pairwise Adjacent 3-, 4-, 5-, and 6-cycle are 4-choosable von Nakprasit, Kittikorn, Sittitrai, Pongpat

Volltext

Defective 2-colorings of planar graphs without 4-cycles and 5-cycles von Sittitrai, Pongpat, Nakprasit, Kittikorn

Volltext

Planar graphs without 4- and 6-cycles are (3,4)-colorable von Nakprasit, Kittikorn, Sittitrai, Pongpat, Pimpasalee, Wannapol

Volltext

Vertex 2-arboricity of planar graphs without 4-cycles adjacent to 6-cycles von Nakprasit, Kittikorn, Ruksasakchai, Watcharintorn, Sittitrai, Pongpat

Volltext

Sufficient Conditions on Planar Graphs to Have a Relaxed DP-3-Coloring von Sittitrai, Pongpat, Nakprasit, Kittikorn

Volltext

Edge DP-coloring of planar graphs without 4-cycles and specific cycles von Jumnongnit, Patcharapan, Nakprasit, Kittikorn, Ruksasakchai, Watcharintorn, Sittitrai, Pongpat

Volltext

Partitioning planar graphs without 4-cycles and 5-cycles into two forests with a specific condition von Tangjai, Wipawee, Nakprasit, Kittikorn, Nakprasit, Keaitsuda Maneeruk, Sittitrai, Pongpat

Volltext

DP-4-colorability of planar graphs without adjacent cycles of given length von Liu, Runrun, Li, Xiangwen, Nakprasit, Kittikorn, Sittitrai, Pongpat, Yu, Gexin

Volltext

Defective DP-colorings of sparse multigraphs von Jing, Yifan, Kostochka, Alexandr, Ma, Fuhong, Sittitrai, Pongpat, Xu, Jingwei

Volltext

Partitioning planar graphs without 4-cycles and 6-cycles into a forest and a disjoint union of paths von Sittitrai, Pongpat, Nakprasit, Kittikorn

Volltext bestellen

Planar graphs without pairwise adjacent 3-,4-,5-, and 6-cycle are 4-choosable von Sittitrai, Pongpat, Nakprasit, Kittikorn

Volltext bestellen