Arbitrarily edge-partitionable graphs
From MaRDI portal
Publication:6648283
DOI10.1016/j.dam.2024.09.033MaRDI QIDQ6648283
Publication date: 4 December 2024
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Connectivity (05C40) Graph operations (line graphs, products, etc.) (05C76)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Decomposing graphs into a constant number of locally irregular subgraphs
- On minimal arbitrarily partitionable graphs
- On the structure of arbitrarily partitionable graphs with given connectivity
- Dense arbitrarily partitionable graphs
- Decomposing trees with large diameter
- On the complexity of partitioning graphs into connected subgraphs
- The edge Hamiltonian path problem is NP-complete
- 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
- On arbitrarily vertex decomposable trees
- Note on Hamilton Circuits
- Arbitrarily vertex decomposable caterpillars with four or five leaves
- A homology theory for spanning tress of a graph
- 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: Arbitrarily edge-partitionable graphs
