Graphs with small bandwidth and cutwidth
Discrete Mathematics, no. 1-3 (1989): 113-119
EI
摘要
We give counter-examples to the following conjecture which arose in the study of small bandwidth graphs. “For a graph G , suppose that | V ( G ')|≤ 1 + c 1 diameter ( G ') for any connected subgraph G ' of G , and that G does not contain any refinement of the complete binary tree of c 2 levels. Is it true that the bandwidth of G can be bo...更多
代码：
数据：
标签
评论
数据免责声明
页面数据均来自互联网公开来源、合作出版商和通过AI技术自动分析结果，我们不对页面数据的有效性、准确性、正确性、可靠性、完整性和及时性做出任何承诺和保证。若有疑问，可以通过电子邮件方式联系我们：report@aminer.cn