Hamiltonian cycles in Dirac graphs-Reference-Cited by-同舟云学术

Hamiltonian cycles in Dirac graphs

Published:2009-05 Issue:3 Volume:29 Page:299-326
ISSN:0209-9683
Container-title:Combinatorica
language:en
Short-container-title:Combinatorica

Author:

Cuckler Bill,Kahn Jeff

Publisher

Springer Science and Business Media LLC

Subject

Computational Mathematics,Discrete Mathematics and Combinatorics

Link

http://link.springer.com/content/pdf/10.1007/s00493-009-2360-2.pdf

Reference20 articles.

1. B. Bollobás: Martingales, isoperimetric inequalities and random graphs, in: Combinatorics (A. Hajnal, L. Lovász and V. T. Sós,eds.), Colloq. Math. Soc. János Bolyai 52, North Holland, 1988.

2. B. Bollobás: Extremal graph theory, in: Handbook of Combinatorics (R. L. Graham, M. Grötschel, L. Lovász, eds.), pp. 1231–1292, Elsevier Science, Amsterdam, 1995.

3. J. A. Bondy: Basic graph theory, in: Handbook of Combinatorics (R. L. Graham, M. Grötschel, L. Lovász, eds.), pp. 3–110, Elsevier Science, Amsterdam, 1995.

4. L. Brégman: Some properties of nonnegative matrices and their permanents, Math. Doklady 14 (1973), 945–949.

5. I. Csiszár and J. Körner: Information theory. Coding theorems for discrete memoryless systems; Akadémiai Kiadó, Budapest, 1981.

Cited by 31 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Optimal spread for spanning subgraphs of Dirac hypergraphs;Journal of Combinatorial Theory, Series B;2024-11

2. Counting oriented trees in digraphs with large minimum semidegree;Journal of Combinatorial Theory, Series B;2024-09

3. Counting spanning subgraphs in dense hypergraphs;Combinatorics, Probability and Computing;2024-05-30

4. A generalization of Bondy’s pancyclicity theorem;Combinatorics, Probability and Computing;2024-04-17

5. A robust Corrádi–Hajnal theorem;Random Structures & Algorithms;2024-02-09