On polynomial time decidability of induced-minor-closed classes
On prime factors of sums of integers III
On Principal Graphs and Weak Duality.
On reconstructing of infinite forests
On signed degrees in signed graphs
On some non-obvious connections between graphs and unary partial algebras
In the present paper we generalize a few algebraic concepts to graphs. Applying this graph language we solve some problems on subalgebra lattices of unary partial algebras. In this paper three such problems are solved, other will be solved in papers [Pió I], [Pió II], [Pió III], [Pió IV]. More precisely, in the present paper first another proof of the following algebraic result from [Bar1] is given: for two unary partial algebras and , their weak subalgebra lattices are isomorphic if and only...
On some problems in combinatorial set theory.
On some regularities of graphs. I.
On some regularities of graphs. II.
On special structure of graphs having the maximal eigenvalue greater than two.
On Spectra of Infinite Graphs
On Spectral Structure Of Graphs Having The Maximal Eigenvalue Not Grater Than Two
On star polynomials, graphical partitions and reconstruction.
On subdirect irreducibility in semiregular categories
On Subgraphs as Matroid Cells.
On systems of graphs intersecting in paths
On systems, periods and semipositive mappings
On the automorphism group of an infinite graph.
On the basis of the direct product of paths and wheels.
On the complexity of the subgraph problem