Zobrazeno 1 - 10
of 232
pro vyhledávání: '"Li Binlong"'
Autor:
Bensmail Julien, Li Binlong
Publikováno v:
Discussiones Mathematicae Graph Theory, Vol 42, Iss 4, Pp 1237-1261 (2022)
A graph G of order n is arbitrarily partitionable (AP) if, for every sequence (n1, . . ., np) partitioning n, there is a partition (V1, . . ., ,Vp) of V (G) such that G[Vi] is a connected ni-graph for i = 1, . . ., p. The property of being AP is rela
Externí odkaz:
https://doaj.org/article/a4309b671ba54f0c9c9ba42cd85783ba
We say that a graph $G$ on $n$ vertices is $\{H,F\}$-$o$-heavy if every induced subgraph of $G$ isomorphic to $H$ or $F$ contains two nonadjacent vertices with degree sum at least $n$. Generalizing earlier sufficient forbidden subgraph conditions for
Externí odkaz:
http://arxiv.org/abs/2409.13491
A subgraph of an edge-colored graph is rainbow if all of its edges have different colors. Let $G$ and $H$ be two graphs. The anti-Ramsey number $\ar(G, H)$ is the maximum number of colors of an edge-coloring of $G$ that does not contain a rainbow cop
Externí odkaz:
http://arxiv.org/abs/2401.01766
Autor:
Li Binlong, Ning Bo
Publikováno v:
Discussiones Mathematicae Graph Theory, Vol 37, Iss 3, Pp 691-710 (2017)
Let G be a graph. Adopting the terminology of Broersma et al. and Čada, respectively, we say that G is 2-heavy if every induced claw (K1,3) of G contains two end-vertices each one has degree at least |V (G)|/2; and G is o-heavy if every induced claw
Externí odkaz:
https://doaj.org/article/6e682e0dedca4276af89a04c4e627354
Bollob\'as proved that for every $k$ and $\ell$ such that $k\mathbb{Z}+\ell$ contains an even number, an $n$-vertex graph containing no cycle of length $\ell \bmod k$ can contain at most a linear number of edges. The precise (or asymptotic) value of
Externí odkaz:
http://arxiv.org/abs/2312.09999
Chung and Graham considered the problem of minimizing the number of edges in an $n$-vertex graph containing all $n$-vertex trees as a subgraph. They showed that such a graph has at least $\frac{1}{2}n \log{n}$ edges. In this note, we improve this low
Externí odkaz:
http://arxiv.org/abs/2311.01488
Publikováno v:
Discussiones Mathematicae Graph Theory, Vol 36, Iss 4, Pp 915-929 (2016)
A graph G is said to be 1-tough if for every vertex cut S of G, the number of components of G − S does not exceed |S|. Being 1-tough is an obvious necessary condition for a graph to be hamiltonian, but it is not sufficient in general. We study the
Externí odkaz:
https://doaj.org/article/d0375a48f0474f1fb97fb44a55e46d6d
Publikováno v:
Discussiones Mathematicae Graph Theory, Vol 36, Iss 2, Pp 363-382 (2016)
In this paper, we consider the least integer d such that every longest cycle of a k-connected graph of order n (and of independent number α) contains all vertices of degree at least d.
Externí odkaz:
https://doaj.org/article/a5f54a27f162485fb76500a81633e50a
Publikováno v:
Discussiones Mathematicae Graph Theory, Vol 34, Iss 2, Pp 287-307 (2014)
A graph is called traceable if it contains a Hamilton path, i.e., a path containing all its vertices. Let G be a graph on n vertices. We say that an induced subgraph of G is o−1-heavy if it contains two nonadjacent vertices which satisfy an Ore-typ
Externí odkaz:
https://doaj.org/article/8a2b714b768147569667b7e7e4c1a5b1
Bondy and Vince showed that every graph with minimum degree at least three contains two cycles of lengths differing by one or two.We prove the following average degree counterpart that every $n$-vertex graph $G$ with at least $\frac52(n-1)$ edges, un
Externí odkaz:
http://arxiv.org/abs/2210.03959