Thickness of graphs with degree constrained vertices

DOI10.1109/TCS.1977.1084323zbMath0353.05044OpenAlexW2125155684MaRDI QIDQ4123358

N. K. Bose, K. A. Prabhu

Publication date: 1977

Published in: IEEE Transactions on Circuits and Systems (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1109/tcs.1977.1084323

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Graph theory (05C99)

Related Items (5)

A tribute to Frank Harary (in honor of his 70th birthday) ⋮ Multilayer grid embeddings for VLSI ⋮ A lower bound on the area of permutation layouts ⋮ Orthogonal drawings of graphs for the automation of VLSI circuit design ⋮ The 4-girth-thickness of the complete multipartite graph

This page was built for publication: Thickness of graphs with degree constrained vertices