Arbitrary partitionability of product graphs
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 1432797 (Why is no real title available?)
- scientific article; zbMATH DE number 6291271 (Why is no real title available?)
- scientific article; zbMATH DE number 5238175 (Why is no real title available?)
- Arbitrarily vertex decomposable trees are of maximum degree at most six
- Dense arbitrarily vertex decomposable graphs
- Dense on-line arbitrarily partitionable graphs
- Hamiltonicity and pancyclicity of Cartesian products of graphs
- Handbook of product graphs
- Partitioning powers of traceable or Hamiltonian graphs
- Recursively arbitrarily vertex-decomposable graphs
Cited in
(9)- BIPARTITE DIVISOR GRAPH FOR THE PRODUCT OF SUBSETS OF INTEGERS
- scientific article; zbMATH DE number 6291271 (Why is no real title available?)
- The partition dimension of strong product graphs and Cartesian product graphs
- Partitioning the Cartesian product of a sun-like graph and a path
- On partitional and other related graphs
- Partitioning the Cartesian product of a star-like tree and a path
- Arbitrarily partitionable product graph of star-like tree and path
- Partitioning the Cartesian product of a tree and a cycle
- scientific article; zbMATH DE number 7673547 (Why is no real title available?)
This page was built for publication: Arbitrary partitionability of product graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2243310)