On the structure of arbitrarily partitionable graphs with given connectivity
From MaRDI portal
(Redirected from Publication:741769)
Recommendations
Cites work
Cited in
(15)- Small dense on-line arbitrarily partitionable graphs
- Partitioning Harary graphs into connected subgraphs containing prescribed vertices
- Partitioning the Cartesian product of a tree and a cycle
- Toughness of Recursively Partitionable Graphs
- Arbitrarily partitionable \(\{2K_2, C_4\}\)-free graphs
- Dense on-line arbitrarily partitionable graphs
- Arbitrary partitionability of product graphs
- A Partially Ordered Structure and a Generalization of the Canonical Partition for General Graphs with Perfect Matchings
- More aspects of arbitrarily partitionable graphs
- On minimal arbitrarily partitionable graphs
- Dense arbitrarily partitionable graphs
- scientific article; zbMATH DE number 3997833 (Why is no real title available?)
- Arbitrarily edge-partitionable graphs
- Structural properties of recursively partitionable graphs with connectivity 2
- Some properties of minimal arbitrarily partitionable graphs
This page was built for publication: On the structure of arbitrarily partitionable graphs with given connectivity
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q741769)