Author:
Győri Ervin,Methuku Abhishek,Salia Nika,Tompkins Casey,Vizer Máté
Funder
National Research, Development and Innovation Office – NKFIH
Hungarian National Research, Development and Innovation Office – NKFIH
Subject
Discrete Mathematics and Combinatorics,Theoretical Computer Science
Reference6 articles.
1. Connected graphs without long paths;Balister;Discrete Math.,2008
2. An Erdős–Gallai type theorem for uniform hypergraphs;Davoodi;European J. Combin.,2018
3. On maximal paths and circuits of graphs;Erdős;Acta Math. Hungar.,1959
4. Hypergraph extensions of the Erdős–Gallai theorem;Győri;European J. Combin.,2016
5. Maximal paths and cycles in a graph;Kopylov;Dokl. Akad. Nauk SSSR,1977
Cited by
12 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献