Zobrazeno 1 - 9
of 9
pro vyhledávání: '"Huajing Lu"'
Publikováno v:
Heliyon, Vol 10, Iss 14, Pp e33516- (2024)
In China, with the ''Double Carbon'' goal within reach, Micro, Small and Medium-sized Enterprises (MSMEs) emerge as pivotal contributors to economic advancement. However, they are now confronted with the imperative of transitioning towards green and
Externí odkaz:
https://doaj.org/article/86ad12895ac64a128c12906c45f7155f
Autor:
Huajing Lu, Fengwei Li
Publikováno v:
Axioms, Vol 12, Iss 2, p 173 (2023)
A graph G has a (d,h)-decomposition if there is a pair (D,F) such that F is a subgraph of G and D is an acyclic orientation of G−E(F), where the maximum degree of F is no more than h and the maximum out-degree of D is no more than d. This paper pro
Externí odkaz:
https://doaj.org/article/cae0c0b336564a21a105d4e158eec93e
A $(d,h)$-decomposition of a graph $G$ is an ordered pair $(D, H)$ such that $H$ is a subgraph of $G$ of maximum degree at most $h$ and $D$ is an acyclic orientation of $G-E(H)$ with maximum out-degree at most $d$. In this paper, we prove that for $l
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::cd2f5dda3162f62b93114c05f43947b1
http://arxiv.org/abs/2111.13825
http://arxiv.org/abs/2111.13825
Autor:
Huajing Lu, Xuding Zhu
A graph $G$ is total weight $(k,k')$-choosable if for any total list assignment $L$ which assigns to each vertex $v$ a set $L(v)$ of $k$ real numbers, and each edge $e$ a set $L(e)$ of $k'$ real numbers, there is a proper total $L$-weighting, i.e., a
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::4f92c4fdebc295269c36b462cdcfe8ef
Autor:
Xuding Zhu, Huajing Lu
Publikováno v:
Discrete Mathematics. 343:111797
This paper proves that if G is a planar graph without 4-cycles and l -cycles for some l ∈ { 5 , 6 , 7 } , then there exists a matching M such that A T ( G − M ) ≤ 3 . This implies that every planar graph without 4-cycles and l -cycles for some
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::dc522629e63b9acb1700fa0bac7519fa
https://doi.org/10.1016/j.disc.2019.111797
https://doi.org/10.1016/j.disc.2019.111797
Publikováno v:
Science China Mathematics. 53:1129-1132
A short cycle means a cycle of length at most 7. In this paper, we prove that planar graphs without adjacent short cycles are 3-colorable. This improves a result of Borodin et al. (2005).
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::a0a1046d5cc9b35e6c55241661ed0c2a
https://doi.org/10.1007/s11425-010-0074-y
https://doi.org/10.1007/s11425-010-0074-y
Publikováno v:
Discrete Mathematics. 310:147-158
It is shown that a planar graph without cycles of length 4, 5, 8, or 9 is 3-choosable.
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::1503ea03670cc6f75841c55d19c14fed
https://doi.org/10.1016/j.disc.2009.08.005
https://doi.org/10.1016/j.disc.2009.08.005
Publikováno v:
Discrete Mathematics
Discrete Mathematics, Elsevier, 2009, 309 (13), pp.4596-4607. ⟨10.1016/j.disc.2009.02.030⟩
Discrete Mathematics, Elsevier, 2009, 309 (13), pp.4596-4607. ⟨10.1016/j.disc.2009.02.030⟩
In this paper, we mainly prove that planar graphs without 4-, 7- and 9-cycles are 3-colorable.
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::cf5f8caf6971be34b319f37c3c5c5120
Publikováno v:
Information Processing Letters. 105:206-211
In this note, we prove that a planar graph is 3-choosable if it contains neither cycles of length 4, 7, and 9 nor 6-cycle with one chord. In particular, every planar graph without cycles of length 4, 6, 7, or 9 is 3-choosable. Together with other kno
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::2c2f22b23ed82a44df91872286fba6cf
https://doi.org/10.1016/j.ipl.2007.08.027
https://doi.org/10.1016/j.ipl.2007.08.027