Dense on-line arbitrarily partitionable graphs

DOI10.1016/J.DAM.2017.04.006zbMath1365.05160OpenAlexW2611995766MaRDI QIDQ2357776

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

Ore conditionperfect matchingtraceable graphpartitions of graphsErdős-Gallai condition

Mathematics Subject Classification ID

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

Related Items (3)

Arbitrary partitionability of product graphs ⋮ 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
• Dense arbitrarily partitionable graphs
• Decomposing trees with large diameter
• On-line arbitrarily vertex decomposable trees
• Arbitrarily vertex decomposable suns with few rays
• On the shape of decomposable trees
• On-line arbitrarily vertex decomposable suns
• A lower bound for the circumference of a graph
• Decomposable trees: A polynomial algorithm for tripodes
• Fully decomposable split graphs
• On maximal paths and circuits of graphs
• Maximal circuits of graphs. I
• An Ore-type condition for arbitrarily vertex decomposable graphs

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