The Menger number of the Cartesian product of graphs
From MaRDI portal
Publication:628251
Recommendations
Cites work
- scientific article; zbMATH DE number 2010366 (Why is no real title available?)
- scientific article; zbMATH DE number 1517141 (Why is no real title available?)
- A counterexample to a conjecture on paths of bounded length
- Bounded edge-connectivity and edge-persistence of Cartesian product of graphs
- Connectivity of Cartesian product graphs
- Connectivity of Cartesian products of graphs
- Graphs as models of communication network vulnerability: Connectivity and persistence
- Hamiltonicity and pancyclicity of Cartesian products of graphs
- Heuristics for finding a maximum number of disjoint bounded paths
- On the \(\{k\}\)-domination number of Cartesian products of graphs
- Retracts of strong products of graphs
- Synthesis of reliable networks - a survey
- The complexity of finding maximum disjoint paths with length constraints
Cited in
(8)- The Menger number of the strong product of graphs
- scientific article; zbMATH DE number 2163972 (Why is no real title available?)
- scientific article; zbMATH DE number 758006 (Why is no real title available?)
- scientific article; zbMATH DE number 5049609 (Why is no real title available?)
- Alliance free sets in Cartesian product graphs
- Hadwiger number and the Cartesian product of graphs
- Zombie number of the Cartesian product of graphs
- The Cartesian product of hypergraphs
This page was built for publication: The Menger number of the Cartesian product of graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q628251)