Name
Abstract | ||
|---|---|---|
We call a graph G a platypus if G is non-hamiltonian, and for any vertex v in G, the graph G - v is traceable. Every hypohamiltonian and every hypotraceable graph is a platypus, but there exist platypuses that are neither hypohamiltonian nor hypotraceable. Among other things, we give a sharp lower bound on the size of a platypus depending on its order, draw connections to other families of graphs, and solve two open problems of Wiener. We also prove that there exists a k-connected platypus for every k >= 2. (C) 2017 Wiley Periodicals, Inc. |
Year | DOI | Venue |
|---|---|---|
2017 | 10.1002/jgt.22122 | JOURNAL OF GRAPH THEORY |
Keywords | Field | DocType |
non-hamiltonian,traceable,hypohamiltonian,hypotraceable | Discrete mathematics,Graph,Topology,Combinatorics,Hamiltonian (quantum mechanics),Vertex (geometry),Mathematics | Journal |
Volume | Issue | ISSN |
86.0 | 2.0 | 0364-9024 |
Citations | PageRank | References |
1 | 0.43 | 10 |
Authors | ||
1 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Carol T. Zamfirescu | 1 | 38 | 15.25 |