On minimal arbitrarily partitionable graphs
DOI10.1016/J.IPL.2012.06.010zbMATH Open1248.05152OpenAlexW2057626995MaRDI QIDQ456092FDOQ456092
Authors: Olivier Baudon, Jakub Przybyło, Mariusz Woźniak 
Publication date: 23 October 2012
Published in: Information Processing Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ipl.2012.06.010
Recommendations
- Some properties of minimal arbitrarily partitionable graphs
- scientific article; zbMATH DE number 1792660
- On the structure of arbitrarily partitionable graphs with given connectivity
- Graph partitions with minimum degree constraints
- scientific article; zbMATH DE number 4021173
- Partitions of multigraphs under minimum degree constraints
- scientific article; zbMATH DE number 3867385
- On partition graphs
- scientific article; zbMATH DE number 3506748
- On partitional and other related graphs
Graph theory (including graph drawing) in computer science (68R10) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)
Cites Work
- A linear-time algorithm for four-partitioning four-connected planar graphs
- Title not available (Why is that?)
- A homology theory for spanning tress of a graph
- A linear algorithm for bipartition of biconnected graphs
- Decomposable trees: A polynomial algorithm for tripodes
- A degree bound on decomposable trees
- On arbitrarily vertex decomposable trees
- Arbitrarily vertex decomposable caterpillars with four or five leaves
- Decomposing trees with large diameter
- On the shape of decomposable trees
- On the structure of arbitrarily partitionable graphs with given connectivity
Cited In (21)
- Partitioning powers of traceable or Hamiltonian graphs
- Partitioning Harary graphs into connected subgraphs containing prescribed vertices
- Partitioning the Cartesian product of a tree and a cycle
- Interplays between variations of arbitrarily partitionable graphs under minimality constraints
- Problème de la bipartition minimale d'un graphe
- Arbitrarily partitionable \(\{2K_2, C_4\}\)-free graphs
- Min-Max Graph Partitioning and Small Set Expansion
- Dense on-line arbitrarily partitionable graphs
- Title not available (Why is that?)
- On the longest path in a recursively partitionable graph
- On smallest regular graphs with a given isopart
- On the structure of arbitrarily partitionable graphs with given connectivity
- More aspects of arbitrarily partitionable graphs
- A minimal surface criterion for graph partitioning
- Dense arbitrarily partitionable graphs
- Arbitrarily edge-partitionable graphs
- Minimum flow number of complete multipartite graphs
- Some properties of minimal arbitrarily partitionable graphs
- About skew partitions in minimal imperfect graphs
- Small dense on-line arbitrarily partitionable graphs
- Title not available (Why is that?)
This page was built for publication: On minimal arbitrarily partitionable graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q456092)
