Author:
Bollobás Béla,Győri Ervin
Subject
Discrete Mathematics and Combinatorics,Theoretical Computer Science
Reference5 articles.
1. P. Erdős, On some problems in graph theory, combinatorial analysis and combinatorial number theory, in: B. Bollobas (Ed.), Graph Theory Combin. pp. 1–17.
2. How to make a graph bipartite;Erdős;J. Combin. Theory B,1988
3. On maximal paths and circuits of graphs;Erdős;Acta Math. Acad. Sci. Hungar.,1959
4. On the number of C5's in a triangle-free graph;Győri;Combinatorica,1989
5. F. Lazebnik, J. Verstraete, On hypergraphs of girth five, Electron. J. Combin. 10 (2003) 15 (Research Paper 25).
Cited by
81 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献