论文信息 - Spanning triangulations in graphs

Spanning triangulations in graphs

We prove that every graph of sufficiently large order n and minimum degree at least 2n-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 ⌈2n-3⌉ - 1 without a spanning triangulation. © 2005 Wiley Periodicals, Inc. J Graph Theory

D. Osthus | Daniela Kühn

[1] Andras Hajnal,et al. On the maximal number of independent circuits in a graph , 1963 .

[2] Vojtech Rödl,et al. The Algorithmic Aspects of the Regularity Lemma , 1994, J. Algorithms.

[3] M. Simonovits,et al. Szemeredi''s Regularity Lemma and its applications in graph theory , 1995 .

[4] Gábor N. Sárközy,et al. On the square of a Hamiltonian cycle in dense graphs , 1996, Random Struct. Algorithms.

[5] János Komlós,et al. Blow-up Lemma , 1997, Combinatorics, Probability and Computing.

[6] Cristina G. Fernandes. A better approximation ratio for the minimum k-edge-connected spanning subgraph problem , 1997, SODA '97.

[7] Gábor N. Sárközy,et al. An algorithmic version of the blow-up lemma , 1998 .

[8] J. Komlos. The Blow-up Lemma , 1999, Combinatorics, Probability and Computing.

[9] Béla Bollobás,et al. Modern Graph Theory , 2002, Graduate Texts in Mathematics.

[10] Celina M. H. de Figueiredo,et al. On the complexity of the approximation of nonplanarity parameters for cubic graphs , 2004, Discret. Appl. Math..

[11] Noga Alon,et al. The Probabilistic Method, Second Edition , 2004 .

[12] Daniela Kühn,et al. Large planar subgraphs in dense graphs , 2005, J. Comb. Theory, Ser. B.