AbstractTwo non-isomorphic graphs are twins if each is isomorphic to a subgraph of the other. We prove that a rayless graph has either infinitely many twins or none
A graph is called odd if there is an orientation of its edges and an automorphism that reverses the ...
We show that there are an infinitude of values (v, k, λ) for which there are a pair of non-isomorphi...
AbstractHarary, Robinson and Wormald (1978) proved that for a complete tripartite graph G = K (m, n,...
AbstractTwo non-isomorphic graphs are twins if each is isomorphic to a subgraph of the other. We pro...
Two non-isomorphic graphs are twins if each is isomorphic to a subgraph of the other. We prove that ...
AbstractWe prove that if a rayless tree T is mutually embeddable and non-isomorphic with another ray...
AbstractWe prove that if a rayless tree T is mutually embeddable and non-isomorphic with another ray...
AbstractBonato and Tardif [A. Bonato, C. Tardif, Mutually embeddable graphs and the tree alternative...
It is customary to call vertices x and y twins if every vertex distinct from x and y is adjacent eit...
It is customary to call vertices x and y twins if every vertex distinct from x and y is adjacent eit...
It is customary to call vertices x and y twins if every vertex distinct from x and y is adjacent eit...
AbstractThe paper presents some results on graphs that do not have two distinct isomorphic spanning ...
AbstractIt is customary to call vertices x and y twins if every vertex distinct from x and y is adja...
We show that a number of graph invariants are, even combined, insufficient to distinguish between noni...
Funding: SDF was supported by a St Leonard’s International Doctoral Fees Scholarship and a School of...
A graph is called odd if there is an orientation of its edges and an automorphism that reverses the ...
We show that there are an infinitude of values (v, k, λ) for which there are a pair of non-isomorphi...
AbstractHarary, Robinson and Wormald (1978) proved that for a complete tripartite graph G = K (m, n,...
AbstractTwo non-isomorphic graphs are twins if each is isomorphic to a subgraph of the other. We pro...
Two non-isomorphic graphs are twins if each is isomorphic to a subgraph of the other. We prove that ...
AbstractWe prove that if a rayless tree T is mutually embeddable and non-isomorphic with another ray...
AbstractWe prove that if a rayless tree T is mutually embeddable and non-isomorphic with another ray...
AbstractBonato and Tardif [A. Bonato, C. Tardif, Mutually embeddable graphs and the tree alternative...
It is customary to call vertices x and y twins if every vertex distinct from x and y is adjacent eit...
It is customary to call vertices x and y twins if every vertex distinct from x and y is adjacent eit...
It is customary to call vertices x and y twins if every vertex distinct from x and y is adjacent eit...
AbstractThe paper presents some results on graphs that do not have two distinct isomorphic spanning ...
AbstractIt is customary to call vertices x and y twins if every vertex distinct from x and y is adja...
We show that a number of graph invariants are, even combined, insufficient to distinguish between noni...
Funding: SDF was supported by a St Leonard’s International Doctoral Fees Scholarship and a School of...
A graph is called odd if there is an orientation of its edges and an automorphism that reverses the ...
We show that there are an infinitude of values (v, k, λ) for which there are a pair of non-isomorphi...
AbstractHarary, Robinson and Wormald (1978) proved that for a complete tripartite graph G = K (m, n,...
DOI
Add to ORKG