On star and caterpillar arboricity
نویسندگان
چکیده
We give new bounds on the star arboricity and the caterpillar arboricity of planar graphs with given girth. One of them answers an open problem of Gyárfás and West: there exist planar graphs with track number 4. We also provide new NP-complete problems.
منابع مشابه
Three ways to cover a graph
We consider the problem of covering a host graph G with several graphs from a fixed template class T . The classical covering number of G with respect to T is the minimum number of template graphs needed to cover the edges of G. We introduce two new parameters: the local and the folded covering number. Each parameter measures how far G is from the template class in a different way. Whereas the ...
متن کاملAcircuitic directed star arboricity of planar graphs with large girth
A directed star forest is a forest all of whose components are stars with arcs emanating from the center to the leaves. The acircuitic directed star arboricity of an oriented graph G is the minimum number of edge-disjoint directed star forests whose union covers all edges of G and such that the union of two such forests is acircuitic. We show that graphs with maximum average degree less than 7 ...
متن کاملMultitrack Interval Graphs
A d-track interval is a union of d intervals, one each from d parallel lines. The intersection graphs of d-track intervals are the unions of d interval graphs. The multitrack interval number or simply track number of a graph G is the minimum number of interval graphs whose union is G. The track number for K m;n is determined by proving that the arboricity of K m;n equals its \caterpillar arbori...
متن کاملStar arboricity
A star forest is a forest all of whose components are stars. The star arboricity, st(G) of a graph G is the minimum number of star forests whose union covers all the edges of G. The arboricity, A(G), of a graph G is the minimum number of forests whose union covers all the edges of G. Clearly st(G) > A(G). In fact, Algor and Alon have given examples which show that in some cases st(G) can be as ...
متن کاملThe acircuitic directed star arboricity of subcubic graphs is at most four
A directed star forest is a forest all of whose components are stars with arcs emanating from the center to the leaves. The acircuitic directed star arboricity of an oriented graph G (that is a digraph with no opposite arcs) is the minimum number of edge-disjoint directed star forests whose union covers all edges of G and such that the union of any two such forests is acircuitic. We show that e...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Discrete Mathematics
دوره 309 شماره
صفحات -
تاریخ انتشار 2009