Interplays between variations of arbitrarily partitionable graphs under minimality constraints
From MaRDI portal
Publication:6571005
Recommendations
Cites work
- scientific article; zbMATH DE number 5238175 (Why is no real title available?)
- A degree bound on decomposable trees
- An Ore-type condition for arbitrarily vertex decomposable graphs
- Arbitrarily vertex decomposable suns with few rays
- Decomposable trees: A polynomial algorithm for tripodes
- Dense arbitrarily partitionable graphs
- Dense arbitrarily vertex decomposable graphs
- Dense on-line arbitrarily partitionable graphs
- More aspects of arbitrarily partitionable graphs
- Note on Hamilton Circuits
- On arbitrarily vertex decomposable trees
- On minimal arbitrarily partitionable graphs
- On-line arbitrarily vertex decomposable suns
- On-line arbitrarily vertex decomposable trees
- Recursively arbitrarily vertex-decomposable graphs
- Recursively arbitrarily vertex-decomposable suns
- Small dense on-line arbitrarily partitionable graphs
- Some properties of minimal arbitrarily partitionable graphs
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)