Dense on-line arbitrarily partitionable graphs

DOI10.1016/J.DAM.2017.04.006MaRDI QIDQ2357776zbMATH OpenOpenAlexFDO

Authors Rafał Kalinowski

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

zbMATH Keywords

Erdős-Gallai conditionOre conditionpartitions of graphsperfect matchingtraceable graph

Mathematics Subject Classification ID

Density (toughness, etc.) (05C42) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Recommendations

• Dense arbitrarily partitionable graphs
• More aspects of arbitrarily partitionable graphs
• On minimal arbitrarily partitionable graphs
• On the structure of arbitrarily partitionable graphs with given connectivity
• Arbitrarily partitionable \(\{2K_2, C_4\}\)-free graphs

Cites work

• A lower bound for the circumference of a graph
• An Ore-type condition for arbitrarily vertex decomposable graphs
• Arbitrarily vertex decomposable suns with few rays
• Arbitrarily vertex decomposable trees are of maximum degree at most six
• Decomposable trees: A polynomial algorithm for tripodes
• Decomposing trees with large diameter
• Dense arbitrarily partitionable graphs
• Fully decomposable split graphs
• scientific article; zbMATH DE number 3515497 (Why is no real title available?)
• scientific article; zbMATH DE number 6291271 (Why is no real title available?)
• scientific article; zbMATH DE number 3186565 (Why is no real title available?)
• scientific article; zbMATH DE number 3186566 (Why is no real title available?)
• Improved degree conditions for Hamiltonian properties
• Maximal circuits of graphs. I
• On maximal paths and circuits of graphs
• On the shape of decomposable trees
• On-line arbitrarily vertex decomposable suns
• On-line arbitrarily vertex decomposable trees
• Partitioning powers of traceable or Hamiltonian graphs

Cited in

(7)

• Arbitrarily partitionable \(\{2K_2, C_4\}\)-free graphs
• Arbitrary partitionability of product graphs
• Partitioning the Cartesian product of a tree and a cycle
• Structural properties of recursively partitionable graphs with connectivity 2
• Small dense on-line arbitrarily partitionable graphs
• Interplays between variations of arbitrarily partitionable graphs under minimality constraints
• Dense arbitrarily partitionable graphs

This page was built for publication: Dense on-line arbitrarily partitionable graphs

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