scientific article; zbMATH DE number 7731166
From MaRDI portal
Publication:6134940
Publication date: 23 August 2023
Full work available at URL: http://ajc.maths.uq.edu.au/pdf/86/ajc_v86_p149.pdf
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Partitioning powers of traceable or Hamiltonian graphs
- On minimal arbitrarily partitionable graphs
- Structural properties of recursively partitionable graphs with connectivity 2
- On the structure of arbitrarily partitionable graphs with given connectivity
- Dense arbitrarily partitionable graphs
- Decomposing trees with large diameter
- On-line arbitrarily vertex decomposable trees
- Arbitrarily vertex decomposable suns with few rays
- On the shape of decomposable trees
- On the complexity of partitioning graphs into connected subgraphs
- Decomposable trees: A polynomial algorithm for tripodes
- Dense arbitrarily vertex decomposable graphs
- Fully decomposable split graphs
- More aspects of arbitrarily partitionable graphs
- On the complexity of partitioning a graph into a few connected subgraphs
- A degree bound on decomposable trees
- Note on Hamilton Circuits
- A homology theory for spanning tress of a graph
- Recursively arbitrarily vertex-decomposable graphs
- Paths, Trees, and Flowers
- Some Theorems on Abstract Graphs
- An Ore-type condition for arbitrarily vertex decomposable graphs
- On three polynomial kernels of sequences for arbitrarily partitionable graphs
This page was built for publication:
