Zobrazeno 1 - 10
of 73
pro vyhledávání: '"Binlong Li"'
Publikováno v:
Electronic Journal of Graph Theory and Applications, Vol 7, Iss 2, Pp 277-299 (2019)
In this paper, we consider the least integer d such that every k-connected graph G of order n (and of independent number α) has a longest cycle containing all vertices of degree at least d. We completely determine the d when k = 2. We propose a conj
Externí odkaz:
https://doaj.org/article/a609479365b54a3095c7274019c19c02
Publikováno v:
Electronic Journal of Graph Theory and Applications, Vol 1, Iss 1, Pp 1-10 (2013)
A block-chain is a graph whose block graph is a path, i.e. it is either a $P_1$, a $P_2$, or a 2-connected graph, or a graph of connectivity 1 with exactly two end-blocks. A graph is called traceable if it contains a Hamilton path. A traceable graph
Externí odkaz:
https://doaj.org/article/880abfa84eab4da0a28e8719507ef358
Autor:
BENSMAIL, JULIEN1 julien.bensmail.phd@gmail.com, BINLONG LI2 binlongli@nwpu.edu.cn
Publikováno v:
Discussiones Mathematicae: Graph Theory. 2022, Vol. 42 Issue 4, p1237-1261. 25p.
Autor:
Wenling Zhou, Binlong Li
Publikováno v:
Graphs and Combinatorics. 39
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::b1f1368d02748f66140525ac2be9df8c
https://doi.org/10.1007/s00373-023-02647-7
https://doi.org/10.1007/s00373-023-02647-7
Publikováno v:
Discrete Applied Mathematics. 307:145-152
Let G be an edge-colored complete graph on n vertices such that there exist at least n distinct colors on edges incident to every pair of its vertices. In this paper, we first show that every edge of G with n ≥ 6 k − 19 is contained in a properly
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::d2df2f261247cf777a14421d66236b4a
https://doi.org/10.1016/j.dam.2021.10.016
https://doi.org/10.1016/j.dam.2021.10.016
Autor:
Binlong Li, Bo Ning
Publikováno v:
The Electronic Journal of Combinatorics. 30
In the 1970s, Erdős asked how many edges are needed in a graph on $n$ vertices, to ensure the existence of a cycle of length exactly $n-k$. In this paper, we consider the spectral analog of Erdős' problem. Indeed, the problem of determining tight s
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::f0e52a69731f8433ef1e14a63a8c02ee
https://doi.org/10.37236/11641
https://doi.org/10.37236/11641
Autor:
Bo Ning, Binlong Li
Publikováno v:
Journal of Graph Theory. 97:642-656
Let the bipartite Tur\'an number $ex(m,n,H)$ of a graph $H$ be the maximum number of edges in an $H$-free bipartite graph with two parts of sizes $m$ and $n$, respectively. In this paper, we prove that $ex(m,n,C_{2t})=(t-1)n+m-t+1$ for any positive i
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::ef81fbacb8c67e1c646556c2fbdf4b74
https://doi.org/10.1002/jgt.22676
https://doi.org/10.1002/jgt.22676
Publikováno v:
Discrete Applied Mathematics
Discrete Applied Mathematics, Elsevier, 2021, 289, pp.32-51. ⟨10.1016/j.dam.2020.09.020⟩
Discrete Applied Mathematics, 2021, 289, pp.32-51. ⟨10.1016/j.dam.2020.09.020⟩
Discrete Applied Mathematics, Elsevier, 2021, 289, pp.32-51. ⟨10.1016/j.dam.2020.09.020⟩
Discrete Applied Mathematics, 2021, 289, pp.32-51. ⟨10.1016/j.dam.2020.09.020⟩
International audience; The 1-2-3 Conjecture asserts that, for every connected graph different from K2 , its edges can be labeled with 1,2,3 so that, when coloring each vertex with the sum of its incident labels, no two adjacent vertices get the same
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::380456c17df0c5f724637463ef4e7f7a
https://doi.org/10.1016/j.dam.2020.09.020
https://doi.org/10.1016/j.dam.2020.09.020
Autor:
Binlong Li
Publikováno v:
Graphs and Combinatorics. 36:1639-1653
Let G be a balanced bipartite graph with bipartite sets X, Y. We say that G is Hamilton-biconnected if there is a Hamilton path connecting any vertex in X and any vertex in Y. We define the bipartite independent number $$\alpha ^o_B(G)$$ to be the ma
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::3cedf44653c1dba5708703e1bef85255
https://doi.org/10.1007/s00373-020-02211-7
https://doi.org/10.1007/s00373-020-02211-7
Publikováno v:
Graphs and Combinatorics. 36:1675-1685
Given a graph G and a positive integer k, the sub-Ramsey number sr(G, k) is defined to be the minimum number m such that every $$K_{m}$$ whose edges are colored using every color at most k times contains a subgraph isomorphic to G all of whose edges
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::e58aa5498fe59f003004e29a79fefa1d
https://doi.org/10.1007/s00373-020-02216-2
https://doi.org/10.1007/s00373-020-02216-2