Name
Abstract | ||
|---|---|---|
We investigate here how far we can extend the notion a flan graph such that harniltonicity is preserved. Let El U C be a Halin graph, T being a tree and C the outer cycle. A k-Hahn graph C. can be obtained from H by adding edges while keeping planarity, joining vertices of H C, such that C C has at most k cycles. We prove that, in the class of cubic 3-connected graphs, all 14-Halin graphs are hamiltonian and all 7-Hahn graphs are 1-edge hamiltonian. These results are best possible. |
Year | Venue | Keywords |
|---|---|---|
2013 | ELECTRONIC JOURNAL OF COMBINATORICS | Halin graph,k-Halin graph,hamiltonian,k-edge hamiltonian |
Field | DocType | Volume |
Discrete mathematics,Combinatorics,Indifference graph,Partial k-tree,Chordal graph,Polyhedral graph,Treewidth,Pathwidth,Halin graph,Mathematics,Pancyclic graph | Journal | 20.0 |
Issue | ISSN | Citations |
1.0 | 1077-8926 | 0 |
PageRank | References | Authors |
0.34 | 3 | 3 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Shabnam Malik | 1 | 0 | 0.68 |
| Ahmad Mahmood Qureshi | 2 | 0 | 1.01 |
| Tudor Zamfirescu | 3 | 77 | 16.85 |