{"title":"On planarity of W-graph","authors":"H. Zhao","doi":"10.1109/CICCAS.1991.184454","DOIUrl":null,"url":null,"abstract":"A W-graph is a graph containing wild components and is very useful for layout design of PCB or LSI/VLSI. A wild component is a connected subgraph containing p vertices 3<or=p< infinity and p-1 edges whose locations are unspecified. This paper gives a definition of a planar W-graph and shows some sufficient conditions for testing whether a W-graph is planar or not. Finally, the difficulty for testing the planarity of a W-graph is discussed.<<ETX>>","PeriodicalId":119051,"journal":{"name":"China., 1991 International Conference on Circuits and Systems","volume":"17 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1991-06-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"2","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"China., 1991 International Conference on Circuits and Systems","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/CICCAS.1991.184454","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 2
Abstract
A W-graph is a graph containing wild components and is very useful for layout design of PCB or LSI/VLSI. A wild component is a connected subgraph containing p vertices 3>