On Graver's Conjecture Concerning the Rigidity Problem of Graphs.
On Hadwiger number of a graph
On Hamilton Circuits and Hamilton Paths.
On Hamiltonian properties of powers of special Hamiltonian graphs
On hypergraphs with every four points spanning at most two triples.
On -Pancyclic Graphs
On -ordered bipartite graphs.
On -ply domatic numbers of graphs
On longest paths and circuits in graphs.
On longest paths in connected graphs
On maximal matchings in and a conjecture of R. Forcade
On Maximum Weight of a Bipartite Graph of Given Order and Size
The weight of an edge xy of a graph is defined to be the sum of degrees of the vertices x and y. The weight of a graph G is the minimum of weights of edges of G. More than twenty years ago Erd˝os was interested in finding the maximum weight of a graph with n vertices and m edges. This paper presents a complete solution of a modification of the above problem in which a graph is required to be bipartite. It is shown that there is a function w*(n,m) such that the optimum weight is either w*(n,m) or...
On minimal energies of trees with given diameter.
On minimal graphs of diameter with every edge in a -cycle
On minimal regular digraphs with girth 4
On minimal words with given subword complexity.
On Minimum (Kq, K) Stable Graphs
A graph G is a (Kq, k) stable graph (q ≥ 3) if it contains a Kq after deleting any subset of k vertices (k ≥ 0). Andrzej ˙ Zak in the paper On (Kq; k)-stable graphs, ( doi:/10.1002/jgt.21705) has proved a conjecture of Dudek, Szyma´nski and Zwonek stating that for sufficiently large k the number of edges of a minimum (Kq, k) stable graph is (2q − 3)(k + 1) and that such a graph is isomorphic to sK2q−2 + tK2q−3 where s and t are integers such that s(q − 1) + t(q − 2) − 1 = k. We have proved (Fouquet...
On multicolor Ramsey number of paths versus cycles.
On n-distant Hamiltonian line graphs. (Short Communication).
On Optimal Realizations of Finite Metric Spaces by Graphs.