Some properties of minimal arbitrarily partitionable graphs

MaRDI QIDQ6134940FDOQ6134940

Authors: Julien Bensmail 

Publication date: 23 August 2023

Full work available at URL: http://ajc.maths.uq.edu.au/pdf/86/ajc_v86_p149.pdf

Recommendations

• On minimal arbitrarily partitionable graphs
• Dense arbitrarily partitionable graphs
• More aspects of arbitrarily partitionable graphs
• Interplays between variations of arbitrarily partitionable graphs under minimality constraints
• Arbitrarily edge-partitionable graphs

Mathematics Subject Classification ID

Combinatorics (05-XX)

Cites Work

• Paths, Trees, and Flowers
• Title not available (Why is that?)
• Note on Hamilton Circuits
• Some Theorems on Abstract Graphs
• On the complexity of partitioning graphs into connected subgraphs
• Title not available (Why is that?)
• A homology theory for spanning tress of a graph
• On the complexity of partitioning a graph into a few connected subgraphs
• On minimal arbitrarily partitionable graphs
• Decomposable trees: A polynomial algorithm for tripodes
• Dense arbitrarily vertex decomposable graphs
• A degree bound on decomposable trees
• Partitioning powers of traceable or Hamiltonian graphs
• Arbitrarily vertex decomposable trees are of maximum degree at most six
• Decomposing trees with large diameter
• On the shape of decomposable trees
• On the structure of arbitrarily partitionable graphs with given connectivity
• Recursively arbitrarily vertex-decomposable graphs
• Structural properties of recursively partitionable graphs with connectivity 2
• An Ore-type condition for arbitrarily vertex decomposable graphs
• On-line arbitrarily vertex decomposable trees
• Arbitrarily vertex decomposable suns with few rays
• Title not available (Why is that?)
• Dense arbitrarily partitionable graphs
• Fully decomposable split graphs
• More aspects of arbitrarily partitionable graphs
• On three polynomial kernels of sequences for arbitrarily partitionable graphs

Cited In (7)

• Interplays between variations of arbitrarily partitionable graphs under minimality constraints
• Toughness of Recursively Partitionable Graphs
• Title not available (Why is that?)
• More aspects of arbitrarily partitionable graphs
• On minimal arbitrarily partitionable graphs
• Arbitrarily edge-partitionable graphs
• About skew partitions in minimal imperfect graphs

This page was built for publication: Some properties of minimal arbitrarily partitionable graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6134940)