Hypergraphs and Whitney's theorem on edge-isomorphisms of graphs
From MaRDI portal
Publication:799693
DOI10.1016/0012-365X(84)90018-9zbMATH Open0548.05046MaRDI QIDQ799693FDOQ799693
Publication date: 1984
Published in: Discrete Mathematics (Search for Journal in Brave)
Cites Work
Cited In (8)
- Hypergraphs With Finitely Many Isomorphism Subtypes
- A hypergraph version of the Gallai-Edmonds Theorem
- Title not available (Why is that?)
- Isomorphic edge disjoint subgraphs of hypergraphs
- Line hypergraphs
- An analogue of the Whithey theorem for edge graphs of multigraphs, and edge multigraphs
- A short proof and a strengthening of the Whitney 2-isomorphism theorem on graphs
- A 2-isomorphism theorem for hypergraphs
Recommendations
- A hypergraph version of the Gallai-Edmonds Theorem π π
- Title not available (Why is that?) π π
- An analogue of the Whithey theorem for edge graphs of multigraphs, and edge multigraphs π π
- A 2-isomorphism theorem for hypergraphs π π
- Isomorphic edge disjoint subgraphs of hypergraphs π π
- On the domination of hypergraphs by their edges π π
- On Hypohamiltonian and Almost Hypohamiltonian Graphs π π
- On edge semi-isomorphisms and semi-dualities of graphs π π
- Title not available (Why is that?) π π
- A short proof and a strengthening of the Whitney 2-isomorphism theorem on graphs π π
This page was built for publication: Hypergraphs and Whitney's theorem on edge-isomorphisms of graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q799693)