Author:
Dvořák Zdeněk,Král’ Daniel,Teska Jakub
Subject
Discrete Mathematics and Combinatorics,Theoretical Computer Science
Reference14 articles.
1. Not every 2-tough graph is hamiltonian;Bauer;Discrete Appl. Math.,2000
2. Chordality and 2-factors in tough graphs;Bauer;Discrete Appl. Math.,2000
3. A tourist guide through treewidth;Bodlaender;Acta Cybernetica,1993
4. More than 1-tough chordal planar graphs are hamiltonian;Böhme;J. Graph Theory,1999
5. Tough enough chordal graphs are hamiltonian;Chen;Networks,1998
Cited by
2 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献