Pełnotekstowe zasoby PLDML oraz innych baz dziedzinowych są już dostępne w nowej Bibliotece Nauki.
Zapraszamy na https://bibliotekanauki.pl
Preferencje help
Polish version English version Język
Widoczny [Schowaj] Abstrakt
Liczba wyników

Znaleziono wyników: 5

Liczba wyników na stronie
first rewind previous Strona / 1 next fast forward last

Wyniki wyszukiwania

help Sortuj według:

help Ogranicz wyniki do:
first rewind previous Strona / 1 next fast forward last
1
Content available remote

Heavy Subgraphs, Stability and Hamiltonicity

100%
Li B., Ning B.
Discussiones Mathematicae Graph Theory
|
2017
|
tom 37
|
nr 3
691-710
EN
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 of G contains two end-vertices with degree sum at least |V (G)| in G. In this paper, we introduce a new concept, and say that G is S-c-heavy if for a given graph S and every induced subgraph G′ of G isomorphic to S and every maximal clique C of G′, every non-trivial component of G′ − C contains a vertex of degree at least |V (G)|/2 in G. Our original motivation is a theorem of Hu from 1999 that can be stated, in terms of this concept, as every 2-connected 2-heavy and N-c-heavy graph is hamiltonian, where N is the graph obtained from a triangle by adding three disjoint pendant edges. In this paper, we will characterize all connected graphs S such that every 2-connected o-heavy and S-c-heavy graph is hamiltonian. Our work results in a different proof of a stronger version of Hu’s theorem. Furthermore, our main result improves or extends several previous results.
2
Artykuł dostępny w postaci pełnego tekstu - kliknij by otworzyć plik
Content available

On path-quasar Ramsey numbers

100%
Li B., Ning B.
Annales Universitatis Mariae Curie-Skłodowska, sectio A – Mathematica
|
2014
|
tom 68
|
nr 2
EN
Let \(G_1\) and \(G_2\) be two given graphs. The Ramsey number \(R(G_1,G_2)\) is the least integer \(r\) such that for every graph \(G\) on \(r\) vertices, either \(G\) contains a \(G_1\) or \(\overline{G}\) contains a \(G_2\). Parsons gave a recursive formula to determine the values of \(R(P_n,K_{1,m})\), where \(P_n\) is a path on \(n\) vertices and \(K_{1,m}\) is a star on \(m+1\) vertices. In this note, we study the Ramsey numbers \(R(P_n,K_1\vee F_m)\), where \(F_m\) is a linear forest on \(m\) vertices. We determine the exact values of \(R(P_n,K_1\vee F_m)\) for the cases \(m\leq n\) and \(m\geq 2n\), and for the case that \(F_m\) has no odd component. Moreover, we give a lower bound and an upper bound for the case \(n+1\leq m\leq 2n-1\) and \(F_m\) has at least one odd component.
3
Content available remote

Heavy subgraph pairs for traceability of block-chains

81%
Li B., Broersma H., Zhang S.
Discussiones Mathematicae Graph Theory
|
2014
|
tom 34
|
nr 2
287-307
EN
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-type degree condition for traceability, i.e., with degree sum at least n−1 in G. A block-chain is a graph whose block graph is a path, i.e., it is either a P1, P2, or a 2-connected graph, or a graph with at least one cut vertex and exactly two end-blocks. Obviously, every traceable graph is a block-chain, but the reverse does not hold. In this paper we characterize all the pairs of connected o−1-heavy graphs that guarantee traceability of block-chains. Our main result is a common extension of earlier work on degree sum conditions, forbidden subgraph conditions and heavy subgraph conditions for traceability
4
Content available remote

Large Degree Vertices in Longest Cycles of Graphs, I

81%
Li B., Xiong L., Yin J.
Discussiones Mathematicae Graph Theory
|
2016
|
tom 36
|
nr 2
363-382
EN
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.
5
Content available remote

Forbidden Subgraphs for Hamiltonicity of 1-Tough Graphs

81%
Li B., Broersma H. J., Zhang S.
Discussiones Mathematicae Graph Theory
|
2016
|
tom 36
|
nr 4
915-929
EN
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 problem of characterizing all graphs H such that every 1-tough H-free graph is hamiltonian. We almost obtain a complete solution to this problem, leaving H = K1 ∪ P4 as the only open case.
first rewind previous Strona / 1 next fast forward last
JavaScript jest wyłączony w Twojej przeglądarce internetowej. Włącz go, a następnie odśwież stronę, aby móc w pełni z niej korzystać.