More aspects of arbitrarily partitionable graphs
From MaRDI portal
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)
Recommendations
- On partitional and other related graphs
- On the structure of arbitrarily partitionable graphs with given connectivity
- Generalized partitions of graphs
- scientific article; zbMATH DE number 2227473
- scientific article; zbMATH DE number 3867385
- On partition graphs
- Partitions of Graphs
- On minimal arbitrarily partitionable graphs
- Partitions of graphs and multigraphs under degree constraints
- Some properties of minimal arbitrarily partitionable graphs
Cites work
- scientific article; zbMATH DE number 3603293 (Why is no real title available?)
- scientific article; zbMATH DE number 3639144 (Why is no real title available?)
- A degree bound on decomposable trees
- A homology theory for spanning tress of a graph
- A method in graph theory
- An Ore-type condition for arbitrarily vertex decomposable graphs
- Claw-free graphs---a survey
- Decomposable trees: A polynomial algorithm for tripodes
- Dense arbitrarily partitionable graphs
- Dense arbitrarily vertex decomposable graphs
- Fully decomposable split graphs
- In the square of graphs, Hamiltonicity and pancyclicity, Hamiltonian connectedness and panconnectedness are equivalent concepts
- Note on Hamilton Circuits
- On the complexity of partitioning a graph into a few connected subgraphs
- On the complexity of partitioning graphs into connected subgraphs
- On three polynomial kernels of sequences for arbitrarily partitionable graphs
- On-line arbitrarily vertex decomposable trees
- Paths, Trees, and Flowers
- Recursively arbitrarily vertex-decomposable graphs
- Reduction of the three-partition problem
- Structural properties of recursively partitionable graphs with connectivity 2
Cited in
(19)- Partitioning powers of traceable or Hamiltonian graphs
- Small dense on-line arbitrarily partitionable graphs
- Partitioning Harary graphs into connected subgraphs containing prescribed vertices
- Partitioning the Cartesian product of a star-like tree and a path
- Partitioning the Cartesian product of a tree and a cycle
- Interplays between variations of arbitrarily partitionable graphs under minimality constraints
- Dense on-line arbitrarily partitionable graphs
- On the longest path in a recursively partitionable graph
- Counting connected partitions of graphs
- Arbitrary partitionability of product graphs
- Partitioning the Cartesian product of a sun-like graph and a path
- On the structure of arbitrarily partitionable graphs with given connectivity
- Closure results for arbitrarily partitionable graphs
- Dense arbitrarily partitionable graphs
- Arbitrarily edge-partitionable graphs
- On the complexity of partitioning a graph into a few connected subgraphs
- Structural properties of recursively partitionable graphs with connectivity 2
- Some properties of minimal arbitrarily partitionable graphs
- Arbitrarily partitionable product graph of star-like tree and path
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)
