%0 Journal Article %1 journals/gc/HuZ16 %A Hu, Zhiquan %A Zhang, Shunzhe %D 2016 %J Graphs and Combinatorics %K dblp %N 2 %P 685-705 %T Every 3-connected K1, 3, N1, 2, 3-free graph is Hamilton-connected. %U http://dblp.uni-trier.de/db/journals/gc/gc32.html#HuZ16 %V 32

@article{journals/gc/HuZ16, added-at = {2016-02-23T00:00:00.000+0100}, author = {Hu, Zhiquan and Zhang, Shunzhe}, biburl = {https://puma.ub.uni-stuttgart.de/bibtex/283e00b0522db5b4a60ca651b2c5c08a6/dblp}, ee = {http://dx.doi.org/10.1007/s00373-015-1598-2}, interhash = {8506a08be6f3ad23c3029a28d04671a6}, intrahash = {83e00b0522db5b4a60ca651b2c5c08a6}, journal = {Graphs and Combinatorics}, keywords = {dblp}, number = 2, pages = {685-705}, timestamp = {2016-02-24T10:31:51.000+0100}, title = {Every 3-connected {K1, 3, N1, 2, 3}-free graph is Hamilton-connected.}, url = {http://dblp.uni-trier.de/db/journals/gc/gc32.html#HuZ16}, volume = 32, year = 2016 }