Loading...
Decomposing claw-free subcubic graphs and 4-chordal subcubic graphs
Aboomahigir, E ; Sharif University of Technology | 2021
235
Viewed
- Type of Document: Article
- DOI: 10.1016/j.dam.2020.01.016
- Publisher: Elsevier B.V , 2021
- Abstract:
- 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. © 2021 Elsevier B.V
- Keywords:
- Graphic methods ; Claw-free ; Claw-free graphs ; Cubic graph ; Edge-sets ; Planar graph ; Spanning tree ; Subcubic graphs ; Subgraphs ; Trees (mathematics)
- Source: Discrete Applied Mathematics ; Volume 296 , 2021 , Pages 52-55 ; 0166218X (ISSN)
- URL: https://www.sciencedirect.com/science/article/abs/pii/S0166218X20300251