Hypergraphs and Whitney's theorem on edge-isomorphisms of graphs
From MaRDI portal
(Redirected from Publication:799693)
Recommendations
- A hypergraph version of the Gallai-Edmonds Theorem
- scientific article; zbMATH DE number 3847439
- 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
- scientific article; zbMATH DE number 634024
- A short proof and a strengthening of the Whitney 2-isomorphism theorem on graphs
Cites work
Cited in
(11)- scientific article; zbMATH DE number 763372 (Why is no real title available?)
- Line hypergraphs
- A hypergraph version of the Gallai-Edmonds Theorem
- scientific article; zbMATH DE number 3847439 (Why is no real title available?)
- A 2-isomorphism theorem for hypergraphs
- Isomorphic edge disjoint subgraphs of hypergraphs
- On automorphisms of line-graphs
- Hypergraphs With Finitely Many Isomorphism Subtypes
- scientific article; zbMATH DE number 746894 (Why is no real title available?)
- A short proof and a strengthening of the Whitney 2-isomorphism theorem on graphs
- An analogue of the Whithey theorem for edge graphs of multigraphs, and edge multigraphs
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)
