Dense on-line arbitrarily partitionable graphs
From MaRDI portal
Publication:2357776
DOI10.1016/j.dam.2017.04.006zbMath1365.05160OpenAlexW2611995766MaRDI QIDQ2357776
Publication date: 14 June 2017
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.dam.2017.04.006
Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Density (toughness, etc.) (05C42)
Related Items
Arbitrary partitionability of product graphs, Partitioning the Cartesian product of a tree and a cycle, Arbitrarily partitionable \(\{2K_2, C_4\}\)-free graphs
Cites Work
- Partitioning powers of traceable or Hamiltonian graphs
- Improved degree conditions for Hamiltonian properties
- 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-line arbitrarily vertex decomposable suns
- A lower bound for the circumference of a graph
- Decomposable trees: A polynomial algorithm for tripodes
- Fully decomposable split graphs
- On maximal paths and circuits of graphs
- Maximal circuits of graphs. I
- An Ore-type condition for arbitrarily vertex decomposable graphs
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item