Zobrazeno 1 - 10
of 77
pro vyhledávání: '"Kwon, Hyemin"'
Autor:
Anderson, James, Chau, Herman, Cho, Eun-Kyung, Crawford, Nicholas, Hartke, Stephen G., Heath, Emily, Henderschedt, Owen, Kwon, Hyemin, Zhang, Zhiyuan
We introduce a new tool useful for greedy coloring, which we call the forb-flex method, and apply it to odd coloring and proper conflict-free coloring of planar graphs. The odd chromatic number, denoted $\chi_{\mathsf{o}}(G)$, is the smallest number
Externí odkaz:
http://arxiv.org/abs/2401.14590
Autor:
Kwon, Hyemin, Park, Boram
An odd coloring of a graph $G$ is a proper coloring of $G$ such that for every non-isolated vertex $v$, there is a color appearing an odd number of times in $N_G(v)$. Odd coloring of graphs was studied intensively in recent few years. In this paper,
Externí odkaz:
http://arxiv.org/abs/2401.11653
The following relaxation of proper coloring the square of a graph was recently introduced: for a positive integer $h$, the proper $h$-conflict-free chromatic number of a graph $G$, denoted $\chi_{pcf}^h(G)$, is the minimum $k$ such that $G$ has a pro
Externí odkaz:
http://arxiv.org/abs/2302.06125
A {\it proper conflict-free $c$-coloring} of a graph is a proper $c$-coloring such that each non-isolated vertex has a color appearing exactly once on its neighborhood. This notion was formally introduced by Fabrici et al., who proved that planar gra
Externí odkaz:
http://arxiv.org/abs/2203.16390
Publikováno v:
In Discrete Mathematics January 2025 348(1)
An {\it odd $c$-coloring} of a graph is a proper $c$-coloring such that each non-isolated vertex has a color appearing an odd number of times on its neighborhood. This concept was introduced very recently by Petru\v sevski and \v Skrekovski and has a
Externí odkaz:
http://arxiv.org/abs/2202.11267
Publikováno v:
J. Graph Theory 104.2 (2023) 372-386
Given a graph $G$, a dominating set of $G$ is a set $S$ of vertices such that each vertex not in $S$ has a neighbor in $S$. The domination number of $G$, denoted $\gamma(G)$, is the minimum size of a dominating set of $G$. The independent domination
Externí odkaz:
http://arxiv.org/abs/2112.11720
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.
Publikováno v:
In Discrete Mathematics May 2023 346(5)
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.