AbstractH. Whitney proved that, apart from a simple exeptional case, whenever the line graphs of two finite graphs are isomorphic then so are the graphs themselves. In this note (i) similar results are proved for finite hypergraphs, (ii) it is shown that certain extensions of Whitney's theorem to hypergraphs are false, (iii) a Whitney-type theorem is established for infinite hypergraphs
The classical Whitney's 2-Isomorphism Theorem describes the families of graphs having the same cycle...
AbstractHarary, Robinson and Wormald (1978) proved that for a complete tripartite graph G = K (m, n,...
A new type of semigroups connected with hypergraphs is considered. Every hypergraph is characterized...
AbstractH. Whitney proved that, apart from a simple exeptional case, whenever the line graphs of two...
AbstractThis paper presents a new proof of Whitney's theorem on edge-isomorphisms of graphs and exte...
AbstractThis paper presents a new proof of Whitney's theorem on edge-isomorphisms of graphs and exte...
AbstractOne can associate a polymatroid with a hypergraph that naturally generalises the cycle matro...
AbstractIn this note we characterize isomorphism between two hypergraphs by means of equicardinality...
This study will examine a fundamental theorem from graph theory: Whitney\u27s 2-Isomorphism Theorem....
AbstractIn this paper, we introduce a new multivalued function L called the line hypergraph. The fun...
AbstractOne can associate a polymatroid with a hypergraph that naturally generalises the cycle matro...
summary:Let $X$ be a finite graph. Let $C(X)$ be the hyperspace of all nonempty subcontinua of $X$ a...
summary:Let $X$ be a finite graph. Let $C(X)$ be the hyperspace of all nonempty subcontinua of $X$ a...
AbstractIn this note we characterize isomorphism between two hypergraphs by means of equicardinality...
AbstractShort proofs of two theorems are given: (i) Whitney's 2-isomorphism theorem characterizing a...
The classical Whitney's 2-Isomorphism Theorem describes the families of graphs having the same cycle...
AbstractHarary, Robinson and Wormald (1978) proved that for a complete tripartite graph G = K (m, n,...
A new type of semigroups connected with hypergraphs is considered. Every hypergraph is characterized...
AbstractH. Whitney proved that, apart from a simple exeptional case, whenever the line graphs of two...
AbstractThis paper presents a new proof of Whitney's theorem on edge-isomorphisms of graphs and exte...
AbstractThis paper presents a new proof of Whitney's theorem on edge-isomorphisms of graphs and exte...
AbstractOne can associate a polymatroid with a hypergraph that naturally generalises the cycle matro...
AbstractIn this note we characterize isomorphism between two hypergraphs by means of equicardinality...
This study will examine a fundamental theorem from graph theory: Whitney\u27s 2-Isomorphism Theorem....
AbstractIn this paper, we introduce a new multivalued function L called the line hypergraph. The fun...
AbstractOne can associate a polymatroid with a hypergraph that naturally generalises the cycle matro...
summary:Let $X$ be a finite graph. Let $C(X)$ be the hyperspace of all nonempty subcontinua of $X$ a...
summary:Let $X$ be a finite graph. Let $C(X)$ be the hyperspace of all nonempty subcontinua of $X$ a...
AbstractIn this note we characterize isomorphism between two hypergraphs by means of equicardinality...
AbstractShort proofs of two theorems are given: (i) Whitney's 2-isomorphism theorem characterizing a...
The classical Whitney's 2-Isomorphism Theorem describes the families of graphs having the same cycle...
AbstractHarary, Robinson and Wormald (1978) proved that for a complete tripartite graph G = K (m, n,...
A new type of semigroups connected with hypergraphs is considered. Every hypergraph is characterized...