Interplays between variations of arbitrarily partitionable graphs under minimality constraints
DOI10.1016/J.AMC.2024.128753zbMATH Open1545.05176MaRDI QIDQ6571005FDOQ6571005
Authors: Olivier Baudon, Julien Bensmail, Morgan Boivin 
Publication date: 11 July 2024
Published in: Applied Mathematics and Computation (Search for Journal in Brave)
Recommendations
minimalityarbitrarily partitionable graphonline arbitrarily partitionable graphrecursively arbitrarily partitionable graphpartition into connected subgraphs
Graph theory (including graph drawing) in computer science (68R10) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)
Cites Work
- Note on Hamilton Circuits
- On minimal arbitrarily partitionable graphs
- Decomposable trees: A polynomial algorithm for tripodes
- Dense arbitrarily vertex decomposable graphs
- A degree bound on decomposable trees
- On arbitrarily vertex decomposable trees
- Recursively arbitrarily vertex-decomposable suns
- Some properties of minimal arbitrarily partitionable graphs
- Recursively arbitrarily vertex-decomposable graphs
- An Ore-type condition for arbitrarily vertex decomposable graphs
- On-line arbitrarily vertex decomposable trees
- Arbitrarily vertex decomposable suns with few rays
- On-line arbitrarily vertex decomposable suns
- Title not available (Why is that?)
- Dense arbitrarily partitionable graphs
- Dense on-line arbitrarily partitionable graphs
- More aspects of arbitrarily partitionable graphs
- Small dense on-line arbitrarily partitionable graphs
Cited In (1)
This page was built for publication: Interplays between variations of arbitrarily partitionable graphs under minimality constraints
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6571005)
