Search

Your search keyword '"Kim, Seog"' showing total 1,629 results
Start Over Author "Kim, Seog"
1,629 results on '"Kim, Seog"'

181. sj-pdf-1-anp-10.1177_00048674211025729 – Supplemental material for Life stress, sleep disturbance and depressive symptoms: The moderating role of prefrontal activation during emotion regulation

Author

Lee, Kyung Hwa, Lee, Ha Young, Park, Inkyung, Jeon, Jeong Eun, Kim, Nambeom, Oh, Seong Min, Jeon, Sehyun, Kim, Soohyun, Lee, Yu Jin, and Kim, Seog Ju

Subjects
FOS: Psychology, FOS: Clinical medicine, embryonic structures, 170199 Psychology not elsewhere classified, biochemical phenomena, metabolism, and nutrition, 110319 Psychiatry (incl. Psychotherapy), digestive system, humanities, Neuroscience
Abstract

Supplemental material, sj-pdf-1-anp-10.1177_00048674211025729 for Life stress, sleep disturbance and depressive symptoms: The moderating role of prefrontal activation during emotion regulation by Kyung Hwa Lee, Ha Young Lee, Inkyung Park, Jeong Eun Jeon, Nambeom Kim, Seong Min Oh, Sehyun Jeon, Soohyun Kim, Yu Jin Lee and Seog Ju Kim in Australian & New Zealand Journal of Psychiatry

Published
2021
Full Text
View/download PDF

182. Planar graphs without intersecting 5-cycles are signed-4-choosable.

Author

Kim, Seog-Jin and Yu, Xiaowei

Subjects
*PLANAR graphs, *INTEGERS
Abstract

A signed graph is a pair (G , σ) , where G is a graph and σ : E (G) → { 1 , − 1 } is a signature of G. A set S of integers is symmetric if i ∈ S implies that − i ∈ S. Given a list assignment L of G , an L -coloring of a signed graph (G , σ) is a coloring f of (G , σ) such that f (v) ∈ L (v) for each v ∈ V (G) and f (u) ≠ σ (u v) f (v) for every edge u v ∈ E (G). The signed choice number ch ± (G) of a graph G is defined to be the minimum integer k such that for any k -list assignment L of G and for any signature σ on G , there is a proper L -coloring of (G , σ). List signed coloring is a generalization of list coloring. However, the difference between signed choice number and choice number can be arbitrarily large. Hu and Wu [Planar graphs without intersecting 5 -cycles are 4 -choosable, Discrete Math. 340 (2017) 1788–1792] showed that every planar graph without intersecting 5-cycles is 4-choosable. In this paper, we prove that ch ± (G) ≤ 4 if G is a planar graph without intersecting 5-cycles, which extends the main result of [D. Hu and J. Wu, Planar graphs without intersecting 5 -cycles are 4 -choosable, Discrete Math. 340 (2017) 1788–1792]. [ABSTRACT FROM AUTHOR]

Published
2022
Full Text
View/download PDF

Catalog

Books, media, physical & digital resources
See catalog results