ویراساینس.
سند علمی

Vertex arboricity of toroidal graphs with a forbidden cycle

Ilkyoo Choi, Haihui Zhang

چکیده

The vertex arboricity a(G) of a graph G is the minimum k such that V (G) can be partitioned into k sets where each set induces a forest. For a planar graph G, it is known that a(G) ≤ 3. In two recent papers, it was proved that planar graphs without k-cycles for some k ∈ {3, 4, 5, 6, 7} have vertex arboricity at most 2. For a toroidal graph G, it is known that a(G) ≤ 4. Let us consider the following question: do toroidal graphs without k-cycles have vertex arboricity at most 2? It was known that the question is true for k = 3, and recently, Zhang proved the question is true for k = 5. Since a complete graph on 5 vertices is a toroidal graph without any k-cycles for k ≥ 6 and has vertex arboricity at least three, the only unknown case was k = 4. We solve this case in the affirmative; namely, we show that toroidal graphs without 4-cycles have vertex arboricity at most 2. © 2014 Elsevier B.V. All rights reserved.

اسناد مشابه

  • on list vertex 2-arboricity of toroidal graphs without cycles of specific length

    مقالهbulletin of the iranian mathematical societyh. zhang, school of mathematical science‎, ‎huaiyin normal university‎, 111 changjiang west road‎, ‎huaian‎, ‎jiangsu‎, 223300‎, ‎p‎. ‎r‎. ‎china.

    the vertex arboricity $rho(g)$ of a graph $g$ is the minimum number of subsets into which the vertex set $v(g)$ can be partitioned so that each subset induces an acyclic graph‎. ‎a graph $g$ is called list vertex $k$-arborable if for any set $l(v)$ of cardinality at least $k$ at

  • On list vertex 2-arboricity of toroidal graphs without cycles of specific length

    مقاله۲۰۱۶Bulletin of the Iranian Mathematical SocietyH. Zhang

    The vertex arboricity $\rho(G)$ of a graph $G$ is the minimum number of subsets into which the vertex set $V(G)$ can be partitioned so that each subset induces an acyclic graph. A graph $G$ is called list vertex $k$-arborable if for any set $L(v)$ of cardinality at least $k$ at e

  • On the vertex arboricity of graphs with prescribed size

    سند علمی۱۹۹۹Australasian J. CombinatoricsNirmala Achuthan, N. R. Achuthan, Lou Caccetta

    ON THE VERTEX ARBORICITY OF GRAPHS WITH PRESCRIBED SIZE Nirmala Achuthan, N.R. Achuthan and L. Caccetta School of Mathematics and Statistics Curtin University of Technology G.P.O. Box U1987 PERTH WA 6845 Let ~(n) denote the class of simple graphs of order n and ~(n,m) the subclas

  • Equitable vertex arboricity of graphs

    سند علمی۲۰۱۳Discrete MathematicsJian-Liang Wu, Xin Zhang, Hailuan Li

    An equitable (t, k, d)-tree-coloring of a graph G is a coloring to vertices of G such that the sizes of any two color classes differ by at most one and the subgraph induced by each color class is a forest of maximum degree at most k and diameter at most d. The minimum t such that

  • Coloring graphs without fan vertex-minors and graphs without cycle pivot-minors

    سند علمی۲۰۱۷J. Comb. Theory, Ser. BIlkyoo Choi, O-joung Kwon, Sang-il Oum

    A fan Fk is a graph that consists of an induced path on k vertices and an additional vertex that is adjacent to all vertices of the path. We prove that for all positive integers q and k, every graph with sufficiently large chromatic number contains either a clique of size q or a

  • A conjecture on equitable vertex arboricity of graphs

    سند علمی۲۰۱۲CoRRXin Zhang, Jian-Liang Wu

    Wu, Zhang and Li [4] conjectured that the set of vertices of any simple graph G can be equitably partitioned into ⌈(∆(G) + 1)/2⌉ subsets so that each of them induces a forest of G. In this note, we prove this conjecture for graphs G with ∆(G) ≥ |G|/2.