scientific article; zbMATH DE number 734483
From MaRDI portal
Publication:4326214
zbMath0814.05061MaRDI QIDQ4326214
Publication date: 8 June 1995
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
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) Coloring of graphs and hypergraphs (05C15)
Related Items (14)
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 ⋮ On the linear \((n - 1)\)-arboricity of \(K_{n(m)}\) ⋮ The linear 2-arboricity of IC-planar graphs ⋮ The linear 2-arboricity of sparse graphs ⋮ Linear 2-arboricity of toroidal graphs ⋮ The linear 3-arboricity of \(K_{n,n}\) and \(K_n\) ⋮ An improved upper bound on the linear 2-arboricity of planar graphs ⋮ The linear 2- and 4-arboricity of complete bipartite graph \(K_{m,n}\) ⋮ Planar graphs without 5-cycles or without 6-cycles ⋮ Linear \(k\)-arboricities on trees ⋮ Light structures in 1-planar graphs with an application to linear 2-arboricity ⋮ The linear \((n - 1)\)-arboricity of some lexicographic product graphs ⋮ The linear 2-arboricity of 1-planar graphs without 3-cycles
This page was built for publication:
