{"title":"派生图的刻画","authors":"Lowell W. Beineke","doi":"10.1016/S0021-9800(70)80019-9","DOIUrl":null,"url":null,"abstract":"<div><p>The derived graph of a graph <em>G</em> has the edges of <em>G</em> as its vertices, with adjacency determined by the adjacency of the edges in <em>G</em>. A new characterization of derived graphs is given in terms of nine excluded subgraphs. A proof of the equivalence of all known characterizations is also given.</p></div>","PeriodicalId":100765,"journal":{"name":"Journal of Combinatorial Theory","volume":"9 2","pages":"Pages 129-135"},"PeriodicalIF":0.0000,"publicationDate":"1970-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1016/S0021-9800(70)80019-9","citationCount":"240","resultStr":"{\"title\":\"Characterizations of derived graphs\",\"authors\":\"Lowell W. Beineke\",\"doi\":\"10.1016/S0021-9800(70)80019-9\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"<div><p>The derived graph of a graph <em>G</em> has the edges of <em>G</em> as its vertices, with adjacency determined by the adjacency of the edges in <em>G</em>. A new characterization of derived graphs is given in terms of nine excluded subgraphs. A proof of the equivalence of all known characterizations is also given.</p></div>\",\"PeriodicalId\":100765,\"journal\":{\"name\":\"Journal of Combinatorial Theory\",\"volume\":\"9 2\",\"pages\":\"Pages 129-135\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1970-09-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"https://sci-hub-pdf.com/10.1016/S0021-9800(70)80019-9\",\"citationCount\":\"240\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Journal of Combinatorial Theory\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://www.sciencedirect.com/science/article/pii/S0021980070800199\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Journal of Combinatorial Theory","FirstCategoryId":"1085","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/S0021980070800199","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
The derived graph of a graph G has the edges of G as its vertices, with adjacency determined by the adjacency of the edges in G. A new characterization of derived graphs is given in terms of nine excluded subgraphs. A proof of the equivalence of all known characterizations is also given.
求助内容：
应助结果提醒方式：
京公网安备 11010802042870号
