More aspects of arbitrarily partitionable graphs
DOI10.7151/dmgt.2343zbMath1494.05091OpenAlexW2900173647MaRDI QIDQ2158201
Publication date: 26 July 2022
Published in: Discussiones Mathematicae. Graph Theory (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.7151/dmgt.2343
Graph theory (including graph drawing) in computer science (68R10) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Connectivity (05C40)
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Structural properties of recursively partitionable graphs with connectivity 2
- Dense arbitrarily partitionable graphs
- On-line arbitrarily vertex decomposable trees
- On the complexity of partitioning graphs into connected subgraphs
- A method in graph theory
- In the square of graphs, Hamiltonicity and pancyclicity, Hamiltonian connectedness and panconnectedness are equivalent concepts
- Reduction of the three-partition problem
- Claw-free graphs---a survey
- Decomposable trees: A polynomial algorithm for tripodes
- Dense arbitrarily vertex decomposable graphs
- Fully decomposable split 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
- 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: More aspects of arbitrarily partitionable graphs
