Closure results for arbitrarily partitionable graphs

DOI10.7494/OPMATH.2024.44.6.773MaRDI QIDQ6642846zbMATH OpenFDO

Authors Julien Bensmail

Publication date 25 November 2024

Published in Opuscula Mathematica (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.7494/OPMATH.2024.44.6.773

zbMATH Keywords

arbitrarily partitionable graphclosureconnected partitiontraceability

Mathematics Subject Classification ID

Eulerian and Hamiltonian graphs (05C45) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Recommendations

• More aspects of arbitrarily partitionable graphs
• Dense arbitrarily partitionable graphs
• Small dense on-line arbitrarily partitionable graphs
• Partitioning powers of traceable or Hamiltonian graphs
• More powerful closure operations on graphs

Cites work

• A degree bound on decomposable trees
• A method in graph theory
• An Ore-type condition for arbitrarily vertex decomposable graphs
• Arbitrarily partitionable \(\{2K_2, C_4\}\)-free graphs
• Closure and factor-critical graphs
• Closure concepts: A survey
• Decomposable trees: A polynomial algorithm for tripodes
• Decomposing trees with large diameter
• Dense arbitrarily partitionable graphs
• Dense arbitrarily vertex decomposable graphs
• Fully decomposable split graphs
• scientific article; zbMATH DE number 5238175 (Why is no real title available?)
• More aspects of arbitrarily partitionable graphs
• Note on Hamilton Circuits
• On arbitrarily vertex decomposable trees
• On three polynomial kernels of sequences for arbitrarily partitionable graphs
• Some Theorems on Abstract Graphs
• The Factorization of Locally Finite Graphs
• Toughness of Recursively Partitionable Graphs

This page was built for publication: Closure results for arbitrarily partitionable graphs

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