scientific article; zbMATH DE number 91047
From MaRDI portal
Publication:4017192
zbMATH Open0758.05074MaRDI QIDQ4017192FDOQ4017192
Authors: Bor-Liang Chen, Kuo-Ching Huang, Hung-Lin Fu
Publication date: 16 January 1993
Title of this publication is not available (Why is that?)
Recommendations
Trees (05C05) Extremal problems in graph theory (05C35) Orthogonal arrays, Latin squares, Room squares (05B15) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)
Cited In (26)
- Linear \(k\)-arboricities on trees
- On linear 2-arboricity of certain graphs
- Simple planar graph partition into three forests
- An improved upper bound on the linear 2-arboricity of 1-planar graphs
- Linear 2-arboricity of planar graphs with neither 3-cycles nor adjacent 4-cycles
- The linear \((n - 1)\)-arboricity of some lexicographic product graphs
- The linear 2-arboricity of IC-planar graphs
- An improved upper bound on the linear 2-arboricity of toroidal graphs
- Linear 2-arboricity of planar graphs with maximum degree nine
- Decomposing a graph into forests: the nine dragon tree conjecture is true
- Linear 2-arboricity of toroidal graphs
- The linear 2- and 4-arboricity of complete bipartite graph \(K_{m,n}\)
- Decomposition of graphs into paths and cycles
- On the linear \((n - 1)\)-arboricity of \(K_{n(m)}\)
- Light structures in 1-planar graphs with an application to linear 2-arboricity
- Title not available (Why is that?)
- Title not available (Why is that?)
- The linear 3-arboricity of \(K_{n,n}\) and \(K_n\)
- The linear 2-arboricity of 1-planar graphs without 3-cycles
- Decomposing a planar graph with girth at least 8 into a forest and a matching
- An improved upper bound on the linear 2-arboricity of planar graphs
- A structural theorem for planar graphs with some applications
- Planar graphs without 5-cycles or without 6-cycles
- The linear 2-arboricity of sparse graphs
- Title not available (Why is that?)
- A note on the linear 2-arboricity of planar graphs
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4017192)