The linear arboricity of a graph $G$ is the minimum number of linear forests of $G$ covering all edges. In 1980, Akiyama, Exoo and Harary proposed a conjecture, known as the Linear Arboricity Conjecture (LAC),
On the Linear Arboricity of Graphs with Treewidth at Most Four Article 19 June 2023 Total coloring of 1-toroidal graphs with maximum degree at least 11 and no adjacent triangles Article 03 May 2016 References Bermond, J.C., Fouquet, J.L., Habib, M., Péroche, B.: On linear k...
In this paper we discuss a new edge-partition problem by introducing the triple arboricity of graphs. A triple arboricity, denoted ta(G), of a graphGis defined as the minimum numberksuch that the edge set ofGcan be decomposed intoksubgraphs, each being a forest of maximum degree at most...
Given a graph G, we define its linear arboricity, denoted by la(G), to be the minimum number of edge-disjoint linear forests in G whose union is E(G). This notion was introduced by Harary [16] in 1970 as one of the covering invariants of graphs, and has been studied quite ...
A combinatorial proof of a sumset conjecture of FurstenbergCombinatorica (IF 1)Daniel Glasscock, Joel Moreira, Florian K. Richter Pub Date: 2023-06-14 An Improved Bound for the Linear Arboricity ConjectureCombinatorica (IF 1)Richard Lang, Luke Postle Pub Date: 2023-06-13 Stronger Counterexample...
On integral mixed Cayley graphs over non-abelian finite groups admitting an abelian subgroup of index 2 Linear Algebra Appl. (2023) W.J. Martin et al. Commutative association schemes Eur. J. Comb. (2009) J.M.P. Balamaceda et al. The Terwilliger algebras of the group association schemes ...
2) the vertice linear arboricity of a graph 图的点线荫度 3) Vertex Arboricity of Square Graphs 平方图的点荫度 4) The List Point Arboricity of Graphs 图的列表点荫度 例句>> 5) edge arboricity 边荫度 1. Let the vertex arboricity of G be denoted by a(G)and theedge arboricityof G by a1...
1) the vertice linear arboricity of a graph 图的点线荫度 2) Vertex Arboricity of Square Graphs 平方图的点荫度 3) The List Point Arboricity of Graphs 图的列表点荫度 例句>> 4) the edge lin-ear arboricity of a graph 图的边线荫度
On the linear k-arboricity of cubic graphsA linear forest is a forest each of whose components are paths. The linear arboricity of a graph is the minimum number of linear forests required to partition E(G) and is denoted by la(G). It is conjectured that la(G) = [(螖+1)/2] for...
linear arboricityThe linear arboricity of a graph G is the minimum number of linear forests which partition the edges of G. In the present, it is proved that if a graph G can be embedded in a surface of Euler characteristic ε< 0 and Δ(G) ≥ (46 - 54ε)~(1/2) + 19, then ...