O jednom algoritme z oblasti ohodnotených grafov
O konstrukcích orientovaných grafů
O kubických grafech
Odd graphs
On 1-Factorability and Edge-Colorability of Cartesian Products of Graphs.
On 2-factors in squares of graphs
On a -factor of the fourth power of a connected graph
On a certain distance between isomorphism classes of graphs
On a Certain Type of Decompositions of Complete Graphs into Factors with Equal Diameters
On a facet of the balanced subgraph polytope
On a generalization of the matroid
On a graph theory problem of M. Koman
On a local property of the unoriented graph of a modular multilattice
On a problem of Davison. (Summary).
On a problem of P. Erdös
On a problem of R. Halin concerning subgraphs of infinite graphs
On a property of neighborhood hypergraphs
The aim of the paper is to show that no simple graph has a proper subgraph with the same neighborhood hypergraph. As a simple consequence of this result we infer that if a clique hypergraph and a hypergraph have the same neighborhood hypergraph and the neighborhood relation in is a subrelation of such a relation in , then is inscribed into (both seen as coverings). In particular, if is also a clique hypergraph, then .
On a quasiordering of bipartite graphs.
On a question of K. Leeb
On a theorem of Fröberg and saturated graphs.