The efficient recognition on net-extensibility of graphs
From MaRDI portal
Publication:687910
zbMath0791.05023MaRDI QIDQ687910
Publication date: 28 June 1994
Published in: Chinese Science Bulletin (Search for Journal in Brave)
Related Items (2)
Orthogonal drawings of graphs for the automation of VLSI circuit design ⋮ Some combinatorial optimization problems arising from VLSI circuit design
This page was built for publication: The efficient recognition on net-extensibility of graphs
