scientific article; zbMATH DE number 3536144

zbMath0344.05140MaRDI QIDQ4111609

V. S. Goncakov, V. B. Alekseev

Publication date: 1976

Full work available at URL: https://eudml.org/doc/70872

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35)

Related Items (12)

On the thickness and arboricity of a graph ⋮ A tribute to Frank Harary (in honor of his 70th birthday) ⋮ Geometric thickness in a grid ⋮ Complete colorings of planar graphs ⋮ The thickness of K1,n,n and K2,n,n ⋮ The thickness and chromatic number of \(r\)-inflated graphs ⋮ The 6-girth-thickness of the complete graph ⋮ The thickness of the Kronecker product of graphs ⋮ Remarks on the thickness of a graph ⋮ A simulated annealing algorithm for determining the thickness of a graph ⋮ The 4-girth-thickness of the complete multipartite graph ⋮ A genetic algorithm for determining the thickness of a graph

This page was built for publication: