On graphs with given neighbourhoods
On graphs with isomorphic, non-isomorphic and connected -neighbourhoods
On graphs with maximum size in their switching classes
In his PhD thesis [Structural aspects of switching classes, Leiden Institute of Advanced Computer Science, 2001] Hage posed the following problem: “characterize the maximum size graphs in switching classes”. These are called s-maximal graphs. In this paper, we study the properties of such graphs. In particular, we show that any graph with sufficiently large minimum degree is s-maximal, we prove that join of two s-maximal graphs is also an s-maximal graph, we give complete characterization of triangle-free...
On graphs with nonisomorphic -neighbourhoods
On graphs with prescribed edge neighbourhoods
On graphs with restricted link graphs and the chromatic number at most
On -closed graphs
On ()-Decompositions of a Complete Graph
On Hadwiger number of a graph
On Hallian digraphs and their binding number
On Hamiltonian circuits and spanning trees of hypercubes
On Hamiltonian properties of powers of special Hamiltonian graphs
On hereditary subdirectly irreducible graphs
On homomorphism perfect graphs
On interval graphs and matrice profiles
On Irreducible Graphs of Diameter Two without Triangles
On isomorphisms of graphs of lattices
On isopart parameters of complete bipartite graphs and -cubes
On -Thin Sets and -Extensive Graphs
On k-closure operators in graphs