研究论文
Spanning triangulations in graphs
Daniela Kühn, Deryk Osthus
University of Birmingham
阅读操作
确认中在文库中上传 PDF 后可生成中文音频讲解。
摘要与影响
摘要 · 完整
We prove that every graph of sufficiently large order n and minimum degree at least 2 n /3 contains a triangulation as a spanning subgraph. This is best possible: for all integers n , there are graphs of order n and minimum degree ⌈2 n /3⌉ − 1 without a spanning triangulation. © 2005 Wiley Periodicals, Inc. J Graph Theory
逐年被引趋势
530
513
15
17
20
25
关键指标
18
被引次数 · OpenAlex
1.28
领域内被引倍数
同类平均 = 1
同类平均 = 1
前 20%
引用位次
同领域 · 同年份 · 同类型
同领域 · 同年份 · 同类型
14
参考文献
Google Scholar 与 OpenAlex 的被引统计范围不同，数值存在差异属正常。
AI 辅助阅读
依据：摘要
论文问答
当前基于摘要回答
可就本文提问；依据不足时会说明。
学术脉络
学科主题
计算机 / AIAdvanced Graph Theory Research
Graph Labeling and Dimension Problems · Limits and Structures in Graph Theory
参考文献 14
A Better Approximation Algorithm for Finding Planar Subgraphs
被引 43Gruiă Cälinescu, Cristina G. Fernandes, Ulrich Finkler · Journal of Algorithms · 1998
Szemeredi''s Regularity Lemma and its applications in graph theory
被引 464János Komlós, Miklós Simonovits · 1995
On the square of a Hamiltonian cycle in dense graphs
被引 83J�nos Koml�s, G�bor N. S�rk�zy, Endre Szemer�di · Random Structures and Algorithms · 1996
此处列出前 3 条
引用本文 18
Embedding large subgraphs into dense graphs
被引 140Daniela Kühn, Deryk Osthus · Cambridge University Press eBooks · 2009
Proof of the bandwidth conjecture of Bollobás and Komlós
被引 92Julia Böttcher, Mathias Schacht, Anusch Taraz · Mathematische Annalen · 2008
Large planar subgraphs in dense graphs
被引 37Daniela Kühn, Deryk Osthus, Anusch Taraz · Journal of Combinatorial Theory Series B · 2005
按被引量排序，此处列出前 3 条