Die dicke des n-dimensionalen Würfel-graphen
From MaRDI portal
Publication:5532256
DOI10.1016/S0021-9800(67)80010-3zbMath0152.41101MaRDI QIDQ5532256
Publication date: 1967
Published in: Journal of Combinatorial Theory (Search for Journal in Brave)
Related Items
Bar visibility numbers for hypercubes and outerplanar digraphs ⋮ The thickness of amalgamations and Cartesian product of graphs ⋮ A survey of the theory of hypercube graphs ⋮ The 4-girth-thickness of the complete graph ⋮ Orthogonal drawings of graphs for the automation of VLSI circuit design ⋮ The thickness of K1,n,n and K2,n,n ⋮ Thickness and outerthickness for embedded graphs ⋮ Graph theory ⋮ The 6-girth-thickness of the complete graph ⋮ A note on the 4-girth-thickness of K_n,n,n ⋮ The thickness of the Kronecker product of graphs ⋮ A simulated annealing algorithm for determining the thickness of a graph ⋮ The 4-girth-thickness of the complete multipartite graph
