Publication:4326214
From MaRDI portal
zbMath0814.05061MaRDI QIDQ4326214
Publication date: 8 June 1995
05C35: Extremal problems in graph theory
05B15: Orthogonal arrays, Latin squares, Room squares
05C70: Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.)
05C15: Coloring of graphs and hypergraphs
Related Items
The linear 2-arboricity of 1-planar graphs without 3-cycles, The linear 2-arboricity of sparse graphs, The linear 2-arboricity of IC-planar graphs, An improved upper bound on the linear 2-arboricity of planar graphs, On the linear \((n - 1)\)-arboricity of \(K_{n(m)}\), An improved upper bound on the linear 2-arboricity of 1-planar graphs, The linear 3-arboricity of \(K_{n,n}\) and \(K_n\), Planar graphs without 5-cycles or without 6-cycles, Linear \(k\)-arboricities on trees, Linear 2-arboricity of toroidal graphs, The linear 2- and 4-arboricity of complete bipartite graph \(K_{m,n}\), Light structures in 1-planar graphs with an application to linear 2-arboricity, The linear \((n - 1)\)-arboricity of some lexicographic product graphs, Linear 2-arboricity of planar graphs with neither 3-cycles nor adjacent 4-cycles