AbstractThis paper presents a new proof of Whitney's theorem on edge-isomorphisms of graphs and extends Whitney's theorem to hypergraphs. Whitney's theorem asserts that any two edge-isomorphic graphs of order at least 5 have their edge-isomorphism induced by a node-isomorphism isomorphism. Previous results of Gardner and of Berge and Rado are used
AbstractHarary, Robinson and Wormald (1978) proved that for a complete tripartite graph G = K (m, n,...
A fundamental theorem of Whitney from 1933 asserts that 2-connected graphs $G$ and $H$ are 2-isomorp...
AbstractGiven two finite subsets A, B of Rk (of Ck) we test in time (ek4 nl)O(1) whether there exist...
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...
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...
AbstractH. Whitney proved that, apart from a simple exeptional case, whenever the line graphs of two...
This study will examine a fundamental theorem from graph theory: Whitney\u27s 2-Isomorphism Theorem....
AbstractOne can associate a polymatroid with a hypergraph that naturally generalises the cycle matro...
AbstractWe show that an edge-bijection between 4-connected graphs preserving homeomorphs of K4 in bo...
AbstractIn this note we characterize isomorphism between two hypergraphs by means of equicardinality...
AbstractThe derivative graphs and their homomorphisms are studied. Inspirated by the Whitney theorem...
In the 1970’s, L. Lovász proved that two graphs G and H are isomorphic if and only if for every grap...
AbstractWe prove that every 3-uniform hypergraph with q edges contain two edge disjoint isomorphic s...
AbstractHarary, Robinson and Wormald (1978) proved that for a complete tripartite graph G = K (m, n,...
A fundamental theorem of Whitney from 1933 asserts that 2-connected graphs $G$ and $H$ are 2-isomorp...
AbstractGiven two finite subsets A, B of Rk (of Ck) we test in time (ek4 nl)O(1) whether there exist...
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...
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...
AbstractH. Whitney proved that, apart from a simple exeptional case, whenever the line graphs of two...
This study will examine a fundamental theorem from graph theory: Whitney\u27s 2-Isomorphism Theorem....
AbstractOne can associate a polymatroid with a hypergraph that naturally generalises the cycle matro...
AbstractWe show that an edge-bijection between 4-connected graphs preserving homeomorphs of K4 in bo...
AbstractIn this note we characterize isomorphism between two hypergraphs by means of equicardinality...
AbstractThe derivative graphs and their homomorphisms are studied. Inspirated by the Whitney theorem...
In the 1970’s, L. Lovász proved that two graphs G and H are isomorphic if and only if for every grap...
AbstractWe prove that every 3-uniform hypergraph with q edges contain two edge disjoint isomorphic s...
AbstractHarary, Robinson and Wormald (1978) proved that for a complete tripartite graph G = K (m, n,...
A fundamental theorem of Whitney from 1933 asserts that 2-connected graphs $G$ and $H$ are 2-isomorp...
AbstractGiven two finite subsets A, B of Rk (of Ck) we test in time (ek4 nl)O(1) whether there exist...
DOI
Add to ORKG