Zobrazeno 1 - 10
of 16
pro vyhledávání: '"Dengju Ma"'
Publikováno v:
Discussiones Mathematicae Graph Theory, Vol 44, Iss 2, p 459 (2024)
Externí odkaz:
https://doaj.org/article/784d4445d9f9415d9bea345b90c236ba
Publikováno v:
Discussiones Mathematicae: Graph Theory. 2024, Vol. 44 Issue 2, p459-473. 15p.
Publikováno v:
Discussiones Mathematicae Graph Theory.
Autor:
Dengju Ma
Publikováno v:
Discrete Mathematics. 346:113214
Publikováno v:
Ars mathematica contemporanea
Let ?$m$? and ?$n$? be two integers. In the paper we show that the orientable genus of the join of a cycle ?$C_m$? and a complete graph ?$K_n$? is ?$\lceil \frac{(m - 2)(n - 2)} { 4} \rceil$? if ?$n = 4$? and ?$m \geq 12$?, or ?$n \geq 5$? and ?$m \g
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::1884c469e5eebc711c84c4c0d48c6b2d
http://www.dlib.si/details/URN:NBN:SI:doc-3UY2BFYV
http://www.dlib.si/details/URN:NBN:SI:doc-3UY2BFYV
Publikováno v:
Israel Journal of Mathematics. 212:219-235
In 1985, Alon and Tarsi conjectured that the length of a shortest cycle cover of a bridgeless graph H is at most 7/5 |E(H|). The conjecture is still open. Let G be a 2-edge-connected graph embedded with face-width k on the non-spherical orientable su
Autor:
Dengju Ma
Publikováno v:
Discrete Applied Mathematics. 173:70-76
In the paper, we give an upper bound for the λ p , q -number of a graph G embeddable on an orientable surface S n in term of n and the maximum degree of G . In particular, we give upper bounds for λ p , q -numbers of a graph G embeddable on the tor
Autor:
Jinhua Wang1 jhwang@ntu.edu.cn, Dengju Ma1 jdm8691@yahoo.com.cn
Publikováno v:
Graphs & Combinatorics. Sep2010, Vol. 26 Issue 5, p737-744. 8p. 1 Diagram.
Publikováno v:
Journal of Combinatorial Optimization. 28:787-799
In the paper we study $$\lambda $$ -numbers of several classes of snarks. We show that the $$\lambda $$ -number of each Blanu $$\breve{s}$$ a snark, Flower snark and Goldberg snark is $$6$$ . For $$n\ge 2$$ , we show that there is a dot product of $$
Publikováno v:
Journal of Systems Science and Complexity. 21:316-322
The authors give an upper bound for the projective plane crossing number of a circular graph. Also, the authors prove the projective plane crossing numbers of circular graph C(8,3) and C(9,3) are 2 and 1, respectively.