On the structure of arbitrarily partitionable graphs with given connectivity
DOI10.1016/J.DAM.2013.09.007zbMATH Open1300.05245OpenAlexW2053743718MaRDI QIDQ741769FDOQ741769
Authors: Olivier Baudon, Florent Foucaud, Jakub Przybyło, Mariusz Woźniak 
Publication date: 12 September 2014
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.dam.2013.09.007
Recommendations
Graph theory (including graph drawing) in computer science (68R10) Connectivity (05C40) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Network design and communication in computer systems (68M10)
Cites Work
Cited In (15)
- 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
- Title not available (Why is that?)
- Dense arbitrarily partitionable graphs
- Arbitrarily edge-partitionable graphs
- Structural properties of recursively partitionable graphs with connectivity 2
- Some properties of minimal arbitrarily partitionable graphs
- Small dense on-line 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)
