ویراساینس.
مقاله

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

h. 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 each vertex $v$ of $g$‎, ‎one can choose a color for each $v$ from its list $l(v)$ so that the subgraph induced by every color class is a forest‎. ‎the smallest $k$ for a graph to be list vertex $k$-arborable is denoted by $rho_l(g)$‎. ‎borodin‎, ‎kostochka and toft (discrete math‎. ‎214 (2000) 101-112) first introduced the list vertex arboricity of $g$‎. ‎in this paper‎, ‎we prove that $rho_l(g)leq 2$ for any toroidal graph without 5-cycles‎. ‎we also show that $rho_l(g)leq 2$ if $g$ contains neither adjacent 3-cycles nor cycles of lengths 6 and 7.

اسناد مشابه

  • List vertex-arboricity of toroidal graphs without 4-cycles adjacent to 3-cycles

    مقاله‌ی دسترسی آزاد۲۰۱۶Discrete MathematicsMinChen, LiHuang, WeifanWang

  • 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 list point arboricity of graphs

    سند علمی۲۰۱۴CoRRXin Zhang

    A graph G is list point k-arborable if, whenever we are given a k-list assignment L(v) of colors for each vertex v ∈ V(G), we can choose a color c(v) ∈ L(v) for each vertex v so that each color class induces an acyclic subgraph of G, and is equitable list point k-arborable if G i

  • 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

  • The list linear arboricity of graphs

    مقاله‌ی دسترسی آزاد۲۰۲۱Journal of Graph Theory['Ringi Kim', 'Luke Postle', '']

    A linear forest is a in which every connected component path. The arboricity of graph G the minimum number forests covering all edges. In 1980, Akiyama, Exoo, and Harary proposed conjecture, known as Linear Arboricity Conjecture (LAC), stating that Δ-regular has ⌈ Δ + 1 2 ⌉ . 198

  • 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.