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)
05C10: Planar graphs; geometric and topological aspects of graph theory
Related Items
Some combinatorial optimization problems arising from VLSI circuit design, Orthogonal drawings of graphs for the automation of VLSI circuit design