DOIAbstract
AbstractWe give a classification of all the countable homogeneous multipartite graphs. This generalizes the similar result for bipartite graphs given in Goldstern et al. (1996) [6]
AbstractWe give a classification of all the countable homogeneous multipartite graphs. This generalizes the similar result for bipartite graphs given in Goldstern et al. (1996) [6]
We determine all graphs whose line graphs (middle graphs, total graphs, respectively) are homogeneou...
In this paper we consider the problem of testing bipartiteness of general graphs. The problem has pr...
In this paper, we state and prove two Fraïssé-style results that cover existence and uniqueness prop...
ABSTRACT. We call a bipartite graph homogeneous if every finite partial automorphism which respects ...
Abstract: "We call a bipartite graph homogeneous if every finite partial automorphism which respects...
In this article we give an explicit classification for the countably infinite graphs G which are, fo...
AbstractWe call a bipartite graph homogeneous if every finite partial automorphism which respects le...
AbstractA graph is connected-homogeneous if any isomorphism between finite connected induced subgrap...
AbstractA relational structure A is called k-homogeneous if each isomorphism between two k-element s...
AbstractFor finite q, we classify the countable, descendant-homogeneous digraphs in which the descen...
This paper deals with the differences between the modular and the homogeneous decomposition of graph...
For finite q, we classify the countable, descendant-homogeneous digraphs in which the descendant set...
A directed graph is connected-homogeneous if any isomorphism between every two finite connected subd...
AbstractA homogeneous factorisation of a graph is a partition of its arc set such that there exist v...
AbstractWe show that, if a bipartite distance-regular graph of valencykhas an eigenvalue of multipli...
We determine all graphs whose line graphs (middle graphs, total graphs, respectively) are homogeneou...
In this paper we consider the problem of testing bipartiteness of general graphs. The problem has pr...
In this paper, we state and prove two Fraïssé-style results that cover existence and uniqueness prop...
ABSTRACT. We call a bipartite graph homogeneous if every finite partial automorphism which respects ...
Abstract: "We call a bipartite graph homogeneous if every finite partial automorphism which respects...
In this article we give an explicit classification for the countably infinite graphs G which are, fo...
AbstractWe call a bipartite graph homogeneous if every finite partial automorphism which respects le...
AbstractA graph is connected-homogeneous if any isomorphism between finite connected induced subgrap...
AbstractA relational structure A is called k-homogeneous if each isomorphism between two k-element s...
AbstractFor finite q, we classify the countable, descendant-homogeneous digraphs in which the descen...
This paper deals with the differences between the modular and the homogeneous decomposition of graph...
For finite q, we classify the countable, descendant-homogeneous digraphs in which the descendant set...
A directed graph is connected-homogeneous if any isomorphism between every two finite connected subd...
AbstractA homogeneous factorisation of a graph is a partition of its arc set such that there exist v...
AbstractWe show that, if a bipartite distance-regular graph of valencykhas an eigenvalue of multipli...
We determine all graphs whose line graphs (middle graphs, total graphs, respectively) are homogeneou...
In this paper we consider the problem of testing bipartiteness of general graphs. The problem has pr...
In this paper, we state and prove two Fraïssé-style results that cover existence and uniqueness prop...
Add to ORKG