Dense arbitrarily partitionable graphs
From MaRDI portal
Publication:907823
DOI10.7151/dmgt.1833zbMath1329.05163OpenAlexW2576200721MaRDI QIDQ907823
Rafał Kalinowski, Ingo Schiermeyer, Monika Pilśniak, Mariusz Woźniak
Publication date: 26 January 2016
Published in: Discussiones Mathematicae. Graph Theory (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.7151/dmgt.1833
Paths and cycles (05C38) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)
Related Items
Dense on-line arbitrarily partitionable graphs, Extremal graphs for the distinguishing index, More aspects of arbitrarily partitionable graphs, Unnamed Item, Partitioning the Cartesian product of a tree and a cycle, Arbitrarily partitionable \(\{2K_2, C_4\}\)-free graphs
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Partitioning powers of traceable or Hamiltonian graphs
- Improved degree conditions for Hamiltonian properties
- On minimal arbitrarily partitionable graphs
- On the structure of arbitrarily partitionable graphs with given connectivity
- On-line arbitrarily vertex decomposable trees
- Arbitrarily vertex decomposable suns with few rays
- On-line arbitrarily vertex decomposable suns
- Decomposable trees: A polynomial algorithm for tripodes
- Dense arbitrarily vertex decomposable graphs
- Recursively arbitrarily vertex-decomposable suns
- On maximal paths and circuits of graphs
- Fully Decomposable Split Graphs
- Maximal circuits of graphs. I
- Recursively arbitrarily vertex-decomposable graphs
- An Ore-type condition for arbitrarily vertex decomposable graphs