Author:
Ozeki Kenta,Wiener Gábor,Zamfirescu Carol T.
Funder
Exploratory Research for Advanced Technology
Budapesti Műszaki és Gazdaságtudományi Egyetem
Nemzeti Kutatási Fejlesztési és Innovációs Hivatal
Japan Society for the Promotion of Science
Fonds Wetenschappelijk Onderzoek
Nemzeti Kutatási, Fejlesztési és Innovaciós Alap
Subject
Discrete Mathematics and Combinatorics,Theoretical Computer Science
Reference17 articles.
1. Spanning spiders and light-splitting switches;Gargano;Discrete Math.,2004
2. Improved bounds for hypohamiltonian graphs;Goedgebeur;Ars Math. Contemp.,2017
3. On almost hypohamiltonian graphs;Goedgebeur;Discrete Math. Theoret. Comput. Sci.,2019
4. Hypohamiltonian Graphs;Holton,1993
5. A Hypotraceable Graph;Horton,1973
Cited by
2 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Performance analysis of evolutionary algorithm for the maximum internal spanning tree problem;The Journal of Supercomputing;2022-02-21
2. Deep neural network method to study computer game;2022 IEEE 2nd International Conference on Power, Electronics and Computer Applications (ICPECA);2022-01-21