Hamilton Cycles, Minimum Degree, and Bipartite Holes-Reference-Cited by-同舟云学术

Hamilton Cycles, Minimum Degree, and Bipartite Holes

Author:

McDiarmid Colin¹,Yolov Nikola²

Affiliation:

1. DEPARTMENT OF STATISTICS; UNIVERSITY OF OXFORD; OXFORD OXFORDSHIRE UNITED KINGDOM OF GREAT BRITAIN AND NORTHERN IRELAND

2. DEPARTMENT OF COMPUTER SCIENCE; UNIVERSITY OF OXFORD; OXFORD OXFORDSHIRE UNITED KINGDOM OF GREAT BRITAIN AND NORTHERN IRELAND

Funder

Engineering and Physical Sciences Research Council

Publisher

Wiley

Subject

Geometry and Topology,Discrete Mathematics and Combinatorics

Link

Reference20 articles.

3. B. Bollobás The evolution of sparse graphs Graph Theory and Combinatorics. Proc. Cambridge Combinatorics Conference in Honour of Paul Erdos 1984

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

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

2. Spanning trees in graphs without large bipartite holes;Combinatorics, Probability and Computing;2023-11-14

4. A generalization of Bondy’s pancyclicity theorem;Proceedings of the 12th European Conference on Combinatorics, Graph Theory and Applications;2023