On linkedness in the Cartesian product of graphs
From MaRDI portal
Abstract: We study linkedness of Cartesian product of graphs and prove that the product of an -linked and a -linked graphs is -linked if the graphs are sufficiently large. Further bounds in terms of connectivity are shown. We determine linkedness of product of paths and product of cycles.
Recommendations
Cites work
- An improved linear edge bound for graph linkages
- Connectivity of Cartesian products of graphs
- Highly linked graphs
- scientific article; zbMATH DE number 1179517 (Why is no real title available?)
- scientific article; zbMATH DE number 1550912 (Why is no real title available?)
- K-linked graphs with girth condition
- On connectivity of the cartesian product of two graphs
- The Cartesian product of a \(k\)-extendable and an \(l\)-extendable graph is \((k+l+1)\)-extendable
- Topological subgraphs in graphs of large girth
Cited in
(7)- Cartesian products of directed graphs with loops
- The linkedness of cubical polytopes: the cube
- scientific article; zbMATH DE number 7390799 (Why is no real title available?)
- Linkedness of Cartesian products of complete graphs
- scientific article; zbMATH DE number 6291271 (Why is no real title available?)
- On the well-coveredness of Cartesian products of graphs
- Connectivity of Cartesian products of graphs
This page was built for publication: On linkedness in the Cartesian product of graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1701356)