Zobrazeno 1 - 10
of 47
pro vyhledávání: '"Ilkyoo Choi"'
Publikováno v:
Journal of Graph Theory. May2023, Vol. 103 Issue 1, p159-170. 12p.
Publikováno v:
Journal of Graph Theory.
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::931798a681fb28bc32b4900b9182cff6
https://doi.org/10.1002/jgt.22968
https://doi.org/10.1002/jgt.22968
Publikováno v:
Discrete Applied Mathematics
A graph where each vertex $v$ has a list $L(v)$ of available colors is $L$-colorable if there is a proper coloring such that the color of $v$ is in $L(v)$ for each $v$. A graph is $k$-choosable if every assignment $L$ of at least $k$ colors to each v
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::a1819064187755327c90bfafe0662fb5
https://doi.org/10.1016/j.dam.2021.09.021
https://doi.org/10.1016/j.dam.2021.09.021
Publikováno v:
Journal of Graph Theory. 98:326-341
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::0ab88d7fcd7acffe136ddb76258270f5
https://doi.org/10.1002/jgt.22700
https://doi.org/10.1002/jgt.22700
Publikováno v:
Discrete Mathematics. 346:113305
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:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::a7afa1e434125203deb402feeae88943
https://doi.org/10.1016/j.disc.2022.113305
https://doi.org/10.1016/j.disc.2022.113305
Publikováno v:
Combinatorica. 40:625-653
We prove several results on coloring squares of planar graphs without 4-cycles. First, we show that if $G$ is such a graph, then $G^2$ is $(\Delta(G)+72)$-degenerate. This implies an upper bound of $\Delta(G)+73$ on the chromatic number of $G^2$ as w
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::9c0e685c88751cbd2e00a1a742be22d6
https://doi.org/10.1007/s00493-019-4014-3
https://doi.org/10.1007/s00493-019-4014-3
Publikováno v:
Discrete Mathematics. :113300
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::7ec7a4f04f85f4fb3a2ab783b5271022
https://doi.org/10.1016/j.disc.2022.113300
https://doi.org/10.1016/j.disc.2022.113300
Publikováno v:
Discrete Mathematics. 345:113029
Let $G$ be a $k$-connected graph on $n$ vertices. Hippchen's Conjecture states that two longest paths in $G$ share at least $k$ vertices. Guti\'errez recently proved the conjecture when $k\leq 4$ or $k\geq \frac{n-2}{3}$. We improve upon both results
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::d913024c28ad70cba33333e0716c8a52
https://doi.org/10.1016/j.disc.2022.113029
https://doi.org/10.1016/j.disc.2022.113029
Publikováno v:
Graphs and Combinatorics. 35:805-813
For a graph G, let $$f_2(G)$$ denote the largest number of vertices in a 2-regular subgraph of G. We determine the minimum of $$f_2(G)$$ over 3-regular n-vertex simple graphs G. To do this, we prove that every 3-regular multigraph with exactly c cut-
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::e014418cb550c802273692a0efbfaadc
https://doi.org/10.1007/s00373-019-02021-6
https://doi.org/10.1007/s00373-019-02021-6
A $d$-dimensional brick is a set $I_1\times \cdots \times I_d$ where each $I_i$ is an interval. Given a brick $B$, a brick partition of $B$ is a partition of $B$ into bricks. A brick partition $\mathcal{P}_d$ of a $d$-dimensional brick is $k$-piercin
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::5368ecc8e20eb5b617c6c00e91dd9812
http://arxiv.org/abs/2101.08192
http://arxiv.org/abs/2101.08192
