K-6 minors in large 6-connected graphs

Kawarabayashi Ken-ichi; Norine Serguei; Thomas Robin; Wollan Paul

首页> 外文期刊>Journal of Combinatorial Theory, Series B >K-6 minors in large 6-connected graphs

【24h】

K-6 minors in large 6-connected graphs

机译：K-6 Minors在大型6连接的图表中

获取原文

获取原文并翻译 | 示例

掌桥外文数据库（机构版） >>

开具论文收录证明 >>

文献代查 >>

页面导航

摘要
著录项
相似文献
相关主题

摘要

Jorgensen conjectured that every 6-connected graph with no K-6 minor has a vertex whose deletion makes the graph planar. We prove the conjecture for all sufficiently large graphs. (C) 2017 Published by Elsevier Inc.

机译：Jorgensen猜测，没有K-6 Minor的每6个连接的图形具有顶点，其删除使图形平面。我们证明了所有足够大的图表的猜想。（c）2017年由elsevier公司发布

著录项

来源
《Journal of Combinatorial Theory, Series B》 |2018年第2018期|共46页
作者
Kawarabayashi Ken-ichi; Norine Serguei; Thomas Robin; Wollan Paul;
展开▼
作者单位

Natl Inst Informat Chiyoda Ku 2-1-2 Hitotsubashi Tokyo 1018430 Japan;

Princeton Univ Dept Math Princeton NJ 08544 USA;

Georgia Inst Technol Sch Math Atlanta GA 30332 USA;

Univ Roma La Sapienza Dept Comp Sci I-00185 Rome Italy;

展开▼
收录信息
原文格式 PDF
正文语种 eng
中图分类代数、数论、组合理论;
关键词
Graph; Graph minor; K-6 minor; Jorgensen's conjecture;

机译：图;图形小;K-6 Minor;Jorgensen的猜想;

相似文献

外文文献
中文文献
专利

1. K-6 minors in 6-connected graphs of bounded tree-width [J] . Kawarabayashi Ken-ichi, Norine Serguei, Thomas Robin, Journal of Combinatorial Theory, Series B . 2019,第期

机译：K-6在6个连接的有界树宽的图表中的Minors
2. Choice number of complete multipartite graphs K3*3,2*(k-5),1*2 and K4,3*2,2*(k-6),1*3 [J] . Wenjie He, Lingmin Zhang, Daniel W. Cranston, Discrete mathematics . 2008,第23期

机译：完整多部分图的选择数K3 * 3,2 *（k-5），1 * 2和K4,3 * 2,2 *（k-6），1 * 3
3. ON THE STRUCTURE OF C_3-CRITICAL MINIMAL 6-CONNECTED GRAPHS [J] . A. V. Pastor Journal of Mathematical Sciences . 2016,第6期

机译：关于C_3临界最小6连通图的结构
4. Finding Forbidden Minors in Sublinear Time: A n^1/2+o(1)-Query One-Sided Tester for Minor Closed Properties on Bounded Degree Graphs [C] . Akash Kumar, C. Seshadhri, Andrew Stolman IEEE Annual Symposium on Foundations of Computer Science . 2018

机译：在亚线性时间中查找禁止的未成年人：有界度图上的次闭合特性的n ^ 1/2 + o（1）-查询单面测试器
5. Approximation Algorithms for Routing and Related Problems on Directed Minor-Free Graphs [D] . ?Salmasi, Ario 2019

机译：近似算法有向未成年人免费图形路由和相关问题
6. Impact of Computed Tomography Scans on the Risk of Thyroid Disease in Minor Head Injury Patients: A Population-Based Retrospective Cohort Study [O] . Shao-Lun Tsao, Yin-Yang Chen, Liang-Tsai Yeh, 2020

机译：计算机断层扫描对轻度颅脑损伤患者甲状腺疾病风险的影响：一项基于人群的回顾性队列研究
7. K_6 minors in 6-connected graphs of bounded tree-width [O] . Kawarabayashi, Ken-ichi, Norine, Serguei, Thomas, Robin, 2013

机译：有界树宽度的6连通图中的K_6个未成年人

K-6 minors in large 6-connected graphs

摘要

著录项

相似文献

相关主题

期刊订阅