发布求助
文献互助 智能选刊 最新文献

Graph Theory and Algorithms最新文献

筛选
英文 中文
Algorithms for some intersection graphs 一些交图的算法
Graph Theory and Algorithms Pub Date : 1980-10-24 DOI: 10.1007/3-540-10704-5_15
T. Kashiwabara
{"title":"Algorithms for some intersection graphs","authors":"T. Kashiwabara","doi":"10.1007/3-540-10704-5_15","DOIUrl":"https://doi.org/10.1007/3-540-10704-5_15","url":null,"abstract":"","PeriodicalId":252371,"journal":{"name":"Graph Theory and Algorithms","volume":"19 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1980-10-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122910888","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 2
An efficient algorithm to find a Hamiltonian circuit in a 4-connected maximal planar graph 在4连通极大平面图中寻找哈密顿电路的一种有效算法
Graph Theory and Algorithms Pub Date : 1980-10-24 DOI: 10.1007/3-540-10704-5_16
Takao Asano, Shunji Kikuchi, N. Saito
{"title":"An efficient algorithm to find a Hamiltonian circuit in a 4-connected maximal planar graph","authors":"Takao Asano, Shunji Kikuchi, N. Saito","doi":"10.1007/3-540-10704-5_16","DOIUrl":"https://doi.org/10.1007/3-540-10704-5_16","url":null,"abstract":"","PeriodicalId":252371,"journal":{"name":"Graph Theory and Algorithms","volume":"72 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1980-10-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114506045","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 2
A status on the linear arboricity 关于线性树性的一种状态
Graph Theory and Algorithms Pub Date : 1980-10-24 DOI: 10.1007/3-540-10704-5_4
J. Akiyama
{"title":"A status on the linear arboricity","authors":"J. Akiyama","doi":"10.1007/3-540-10704-5_4","DOIUrl":"https://doi.org/10.1007/3-540-10704-5_4","url":null,"abstract":"","PeriodicalId":252371,"journal":{"name":"Graph Theory and Algorithms","volume":"65 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1980-10-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132827251","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 11
On centrality functions of a graph 关于图的中心性函数
Graph Theory and Algorithms Pub Date : 1980-10-24 DOI: 10.1007/3-540-10704-5_5
G. Kishi
{"title":"On centrality functions of a graph","authors":"G. Kishi","doi":"10.1007/3-540-10704-5_5","DOIUrl":"https://doi.org/10.1007/3-540-10704-5_5","url":null,"abstract":"","PeriodicalId":252371,"journal":{"name":"Graph Theory and Algorithms","volume":"27 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1980-10-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127415574","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 8
A linear algorithm for five-coloring a planar graph 平面图形五色的线性算法
Graph Theory and Algorithms Pub Date : 1980-10-24 DOI: 10.1007/3-540-10704-5_2
Norishige Chiba, Takao Nishizeki, N. Saito
{"title":"A linear algorithm for five-coloring a planar graph","authors":"Norishige Chiba, Takao Nishizeki, N. Saito","doi":"10.1007/3-540-10704-5_2","DOIUrl":"https://doi.org/10.1007/3-540-10704-5_2","url":null,"abstract":"","PeriodicalId":252371,"journal":{"name":"Graph Theory and Algorithms","volume":"13 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1980-10-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115596137","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 15
A graph-planarization algorithm and its application to random graphs 一种图平面化算法及其在随机图中的应用
Graph Theory and Algorithms Pub Date : 1980-10-24 DOI: 10.1007/3-540-10704-5_9
T. Ozawa, H. Takahashi
{"title":"A graph-planarization algorithm and its application to random graphs","authors":"T. Ozawa, H. Takahashi","doi":"10.1007/3-540-10704-5_9","DOIUrl":"https://doi.org/10.1007/3-540-10704-5_9","url":null,"abstract":"","PeriodicalId":252371,"journal":{"name":"Graph Theory and Algorithms","volume":"2016 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1980-10-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132639907","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 47
Some common properties for regulizable graphs, edge-critical graphs and B-graphs 可正则图、边临界图和b图的一些常见性质
Graph Theory and Algorithms Pub Date : 1980-10-24 DOI: 10.1007/3-540-10704-5_10
C. Berge
{"title":"Some common properties for regulizable graphs, edge-critical graphs and B-graphs","authors":"C. Berge","doi":"10.1007/3-540-10704-5_10","DOIUrl":"https://doi.org/10.1007/3-540-10704-5_10","url":null,"abstract":"","PeriodicalId":252371,"journal":{"name":"Graph Theory and Algorithms","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1980-10-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128911655","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 32
On central trees of a graph 在图的中心树上
Graph Theory and Algorithms Pub Date : 1980-10-24 DOI: 10.1007/3-540-10704-5_12
S. Shinoda, Tatsuya Kawamoto
{"title":"On central trees of a graph","authors":"S. Shinoda, Tatsuya Kawamoto","doi":"10.1007/3-540-10704-5_12","DOIUrl":"https://doi.org/10.1007/3-540-10704-5_12","url":null,"abstract":"","PeriodicalId":252371,"journal":{"name":"Graph Theory and Algorithms","volume":"2 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1980-10-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126942130","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 4
"Dualities" in graph theory and the related fields viewed from the metatheoretical standpoint 从元理论的角度看图论及其相关领域的“对偶性”
Graph Theory and Algorithms Pub Date : 1980-10-24 DOI: 10.1007/3-540-10704-5_11
M. Iri
{"title":"\"Dualities\" in graph theory and the related fields viewed from the metatheoretical standpoint","authors":"M. Iri","doi":"10.1007/3-540-10704-5_11","DOIUrl":"https://doi.org/10.1007/3-540-10704-5_11","url":null,"abstract":"","PeriodicalId":252371,"journal":{"name":"Graph Theory and Algorithms","volume":"37 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1980-10-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116040162","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 4
The subgraph homeomorphism problem on reducible flow graphs 可约流图上的子图同胚问题
Graph Theory and Algorithms Pub Date : 1980-10-24 DOI: 10.1007/3-540-10704-5_7
T. Hirata, M. Kimura
{"title":"The subgraph homeomorphism problem on reducible flow graphs","authors":"T. Hirata, M. Kimura","doi":"10.1007/3-540-10704-5_7","DOIUrl":"https://doi.org/10.1007/3-540-10704-5_7","url":null,"abstract":"","PeriodicalId":252371,"journal":{"name":"Graph Theory and Algorithms","volume":"36 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1980-10-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127462606","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 1
下一页 尾页
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整，为了账户安全，请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
请完成安全验证×
相关产品
×
本文献相关产品
联系我们：info@booksci.cn Book学术提供免费学术资源搜索服务，方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号：481959085
Book学术官方微信