activity
20182026
most citedMaximum size of a triangle-free graph with bounded maximum degree and matching number

1 citations · 3 across the 6 of their papers we have counts for

collaborators
Showing 2018Show all

2 papers · 1 filter

math.CO2018

Hoffmann-Ostenhof's conjecture for claw-free cubic graphs

Milad Ahanjideh, Elham Aboomahigir

Hoffmann-Ostenhof's Conjecture states that states that the edge set of every connected cubic graph can be decomposed into a spanning tree, a matching and a -regular subgraph. In…

math.CO2018

Decomposing Claw-free Subcubic Graphs and -Chordal Subcubic Graphs

Elham Aboomahigir, Milad Ahanjideh, Saieed Akbari

Hoffmann-Ostenhof's Conjecture states that the edge set of every connected cubic graph can be decomposed into a spanning tree, a matching and a -regular subgraph. In this paper,…