zbMATH — the first resource for mathematics

Geometry Search for the term Geometry in any field. Queries are case-independent.
Funct* Wildcard queries are specified by * (e.g. functions, functorial, etc.). Otherwise the search is exact.
"Topological group" Phrases (multi-words) should be set in "straight quotation marks".
au: Bourbaki & ti: Algebra Search for author and title. The and-operator & is default and can be omitted.
Chebyshev | Tschebyscheff The or-operator | allows to search for Chebyshev or Tschebyscheff.
"Quasi* map*" py: 1989 The resulting documents have publication year 1989.
so: Eur* J* Mat* Soc* cc: 14 Search for publications in a particular source with a Mathematics Subject Classification code (cc) in 14.
"Partial diff* eq*" ! elliptic The not-operator ! eliminates all results containing the word elliptic.
dt: b & au: Hilbert The document type is set to books; alternatively: j for journal articles, a for book articles.
py: 2000-2015 cc: (94A | 11T) Number ranges are accepted. Terms can be grouped within (parentheses).
la: chinese Find documents in a given language. ISO 639-1 language codes can also be used.

a & b logic and
a | b logic or
!ab logic not
abc* right wildcard
"ab c" phrase
(ab c) parentheses
any anywhere an internal document identifier
au author, editor ai internal author identifier
ti title la language
so source ab review, abstract
py publication year rv reviewer
cc MSC code ut uncontrolled term
dt document type (j: journal article; b: book; a: book article)
Extending cycles in bipartite graphs. (English) Zbl 0674.05044
Let G(X,Y,E) be a balanced bipartite graph of order 2n. We introduce the following definitions. A cycle C in G is extendable if there exists a cycle C’ in G such that V(C)$\subseteq V(C')$ and $\vert V(C')\vert =\vert V(C)\vert +2$. G is bi-cycle extendable if G has at least one cycle and every nonhamiltonian cycle in G is extendable. G has a bi- pancyclic ordering if the vertices of X and Y can be labelled $x\sb 1,x\sb 2,...,x\sb n$ and $y\sb 1,y\sb 2,...,y\sb n$, respectively, so that $C\sb{2k}\subseteq <x\sb 1,...,x\sb k,y\sb 1,...,y\sb k>,$ for $2\le k\le n.$ Let $$ {\bar \sigma}(G)=\min \{d(x)+d(y):\quad x\in X,\quad y\in Y\quad and\quad xy\not\in E(G)\}. $$ It is shown that if ${\bar \sigma}$(G)$\ge n+1$ and C is a 2k-cycle in G then C is extendable unless $<V(C)>\cong K\sb{k,k}$. As consequences of the proof of this result, we deduce that if either ${\bar \sigma}(G)\ge (7n+1)/6$ or $\delta (G)\ge (n+1)/2$ then, in each case with one exceptional graph, G is bi-cycle extendable. It is also shown that if $\ell$ is an integer such that $n\ge 2\ell \ge 2,$ $\delta (G)\ge \ell$ and $\vert E(G)\vert \ge n\sp 2-\ell n+\ell\sp 2$ then every cycle of length at least $\ell$ in G is extendable unless $G\cong K\sb{n,n}-E(K\sb{\ell,n-\ell}).$ As a corollary, we deduce that such graph G has a bi-pancyclic ordering unless $G\cong K\sb{n,n}-E(K\sb{\ell,n-\ell}).$ A number of preliminary results are required, among which is the determination of the maximum size of a balanced bipartite graph of specified order, minimum degree and edge independence number.
Reviewer: G.R.T.Hendry

05C38Paths; cycles
Full Text: DOI
[1] Behzad, M.; Chartrand, G.; Lesniak-Foster, L.: Graphs and digraphs. (1979) · Zbl 0403.05027
[2] Bondy, J. A.; Chvátal, V.: A method in graph theory. Discrete math. 15, 111-135 (1976) · Zbl 0331.05138
[3] Hendry, G. R. T: Extending cycles in graphs. Discrete math. 85, 59-72 (1990) · Zbl 0714.05038
[4] Hendry, G. R. T: On paths, factors and cycles in graphs. Ph.d. thesis (1985) · Zbl 0592.05039
[5] J. Mitchem and E. Schmeichel, Pancyclic graphs and bipancyclic graphs--A survey, preprint. · Zbl 0566.05043
[6] Moon, J.; Moser, L.: On Hamiltonian bipartite graphs. Israel J. Math. 1, 163-165 (1963) · Zbl 0119.38806
[7] Schmeichel, E.; Mitchem, J.: Bipartite graphs with cycles of all even lengths. J. graph theory 6, 429-439 (1982) · Zbl 0502.05036