More aspects of arbitrarily partitionable graphs
DOI10.7151/DMGT.2343zbMATH Open1494.05091OpenAlexW2900173647MaRDI QIDQ2158201FDOQ2158201
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) 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) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)
Cites Work
- Title not available (Why is that?)
- Paths, Trees, and Flowers
- Claw-free graphs---a survey
- Note on Hamilton Circuits
- On the complexity of partitioning graphs into connected subgraphs
- Title not available (Why is that?)
- A homology theory for spanning tress of a graph
- On the complexity of partitioning a graph into a few connected subgraphs
- A method in graph theory
- In the square of graphs, Hamiltonicity and pancyclicity, Hamiltonian connectedness and panconnectedness are equivalent concepts
- Decomposable trees: A polynomial algorithm for tripodes
- Dense arbitrarily vertex decomposable graphs
- A degree bound on decomposable trees
- Recursively arbitrarily vertex-decomposable graphs
- Structural properties of recursively partitionable graphs with connectivity 2
- An Ore-type condition for arbitrarily vertex decomposable graphs
- On-line arbitrarily vertex decomposable trees
- Dense arbitrarily partitionable graphs
- Fully decomposable split graphs
- Reduction of the three-partition problem
- On three polynomial kernels of sequences for arbitrarily partitionable graphs
Cited In (5)
Recommendations
- On partitional and other related graphs π π
- On the structure of arbitrarily partitionable graphs with given connectivity π π
- Generalized partitions of graphs π π
- Title not available (Why is that?) π π
- Title not available (Why is that?) π π
- On partition graphs π π
- Partitions of Graphs π π
- On minimal arbitrarily partitionable graphs π π
- Partitions of graphs and multigraphs under degree constraints π π
- Title not available (Why is that?) π π
This page was built for publication: More aspects of arbitrarily partitionable graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2158201)