Loading...

Decomposing claw-free subcubic graphs and 4-chordal subcubic graphs

Aboomahigir, E ; Sharif University of Technology | 2020

346 Viewed
  1. Type of Document: Article
  2. DOI: 10.1016/j.dam.2020.01.016
  3. Publisher: Elsevier B.V , 2020
  4. Abstract:
  5. 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 2-regular subgraph. In this paper, we show that the conjecture holds for claw-free subcubic graphs and 4-chordal subcubic graphs. © 2020
  6. Keywords:
  7. 4-chordal subcubic graph ; Claw-free graph ; Hoffmann–Ostenhof's conjecture ; Planar graph ; Subcubic graph ; Graphic methods ; Claw-free ; Claw-free graphs ; Cubic graph ; Edge-sets ; Planar graph ; Spanning tree ; Subcubic graphs ; Subgraphs ; Trees (mathematics)
  8. Source: Discrete Applied Mathematics ; 2020
  9. URL: https://www.sciencedirect.com/science/article/abs/pii/S0166218X20300251