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

@article{Ahanjideh2018HoffmannOstenhofsCF, title={Hoffmann-Ostenhof's conjecture for claw-free cubic graphs.}, author={Milad Ahanjideh and Elham Aboomahigir}, journal={arXiv: Combinatorics}, year={2018} }

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 $2$-regular subgraph. In this paper, we show that the conjecture holds for claw-free cubic graphs.

#### References

SHOWING 1-10 OF 12 REFERENCES

Hoffmann-Ostenhof's conjecture for traceable cubic graphs

- Computer Science, Mathematics
- ArXiv
- 2016

It is shown that Hoffmann-Ostenhof's conjecture that every connected cubic graph can be decomposed into a spanning tree, a matching and a family of cycles holds for traceable cubic graphs. Expand

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

- Computer Science, Mathematics
- Discret. Appl. Math.
- 2021

The conjecture that every connected cubic graph can be decomposed into a spanning tree, a matching and a regular subgraph holds for claw-free subcubic graphs and $4-chordal subcUBic graphs. Expand

Decomposing plane cubic graphs

- Mathematics, Computer Science
- Eur. J. Comb.
- 2016

The conjecture that the edge set of every cubic graph can be decomposed into a spanning tree, a matching and a family of cycles is proved and a polynomial time algorithm is provided to find the decomposition for 3-connected cubic plane graphs. Expand

Decomposition of Cubic Graphs on the Torus and Klein Bottle

- Mathematics
- 2015

It was conjectured by Hoffman-Ostenhof that the edge set of every cubic graph can be decomposed into a spanning tree, a matching, and a family of cycles. This conjecture was verified for many graphs… Expand

Decompositions of graphs into trees, forests, and regular subgraphs

- Computer Science, Mathematics
- Discret. Math.
- 2015

A conjecture by A. Hoffmann-Ostenhof suggests that any connected cubic graph G contains a spanning tree T for which every component of G - E ( T ) is a K 1 , a K 2 , or a cycle. We show that any… Expand

Locating-total domination in claw-free cubic graphs

- Computer Science, Mathematics
- Discret. Math.
- 2012

It is shown that the locating-total domination number of a claw-free cubic graph is at most one-half its order and the graphs achieving this bound are characterized. Expand

Introduction to Graph Theory

- Mathematics
- 1995

1. Fundamental Concepts. What Is a Graph? Paths, Cycles, and Trails. Vertex Degrees and Counting. Directed Graphs. 2. Trees and Distance. Basic Properties. Spanning Trees and Enumeration.… Expand

Nowhere-zero flows and structures in cubic graphs

- Physics
- 2011

Wir widerlegen zwei Vermutungen, die im Zusammenhang mit Kreisuberdeckungen von kubischen Graphen stehen. Die erste Vermutung, welche kubische Graphen mit dominierenden Kreisen betrifft, widerlegen… Expand

Research problems from the BCC22

- Computer Science, Mathematics
- Discret. Math.
- 2011

Open problems from the problem session at the 22nd British Combinatorial Conference at St Andrews, on 10 July 2009.

Decomposition planar cubic graphs

- J. Graph Theory
- 2018