|
|
Venues (Conferences, Journals, ...)
|
|
GrowBag graphs for keyword ? (Num. hits/coverage)
Group by:
The graphs summarize 35 occurrences of 16 keywords
|
|
|
Results
Found 64 publication records. Showing 64 according to the selection in the facets
Hits ?▲ |
Authors |
Title |
Venue |
Year |
Link |
Author keywords |
235 | Tung-Yang Ho, Chun-Nan Hung, Lih-Hsing Hsu |
On cubic 2-independent Hamiltonian connected graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Comb. Optim. ![In: J. Comb. Optim. 14(2-3), pp. 275-294, 2007. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
Connectivity, Hamiltonian, Hamiltonian connected |
89 | Dengxin Li, Hong-Jian Lai, Yehong Shao, Mingquan Zhan |
Hamiltonian Connected Line Graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
International Conference on Computational Science (3) ![In: Computational Science - ICCS 2007, 7th International Conference, Beijing, China, May 27 - 30, 2007, Proceedings, Part III, pp. 377-380, 2007, Springer, 978-3-540-72587-9. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
Hourglass, Hourglass-Free, Hamiltonian Connected, Line Graph |
83 | Jung-Heum Park, Hee-Chul Kim, Hyeong-Seok Lim |
Fault-Hamiltonicity of Hypercube-Like Interconnection Networks. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IPDPS ![In: 19th International Parallel and Distributed Processing Symposium (IPDPS 2005), CD-ROM / Abstracts Proceedings, 4-8 April 2005, Denver, CO, USA, 2005, IEEE Computer Society, 0-7695-2312-9. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
|
81 | Jung-Sheng Fu |
Hamiltonicity of the WK-Recursive Network with and without Faulty Nodes. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Parallel Distributed Syst. ![In: IEEE Trans. Parallel Distributed Syst. 16(9), pp. 853-865, 2005. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
WK-recursive, interconnection network, embedding, Hamiltonian cycle, fault-tolerant embedding, Hamiltonian-connected |
72 | Jung-Sheng Fu |
Hamiltonian-Connectedness of the WK-Recursive Network. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISPAN ![In: 7th International Symposium on Parallel Architectures, Algorithms, and Networks (I-SPAN 2004), 10-12 May 2004, Hong Kong, SAR, China, pp. 569-574, 2004, IEEE Computer Society, 0-7695-2135-5. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
WK-recursive, interconnection network, embedding, Hamiltonian-connected |
68 | Kyoung-Wook Park, Hyeong-Seok Lim, Jung-Heum Park, Hee-Chul Kim |
Fault Hamiltonicity of Meshes with Two Wraparound Edges. ![Search on Bibsonomy](Pics/bibsonomy.png) |
COCOON ![In: Computing and Combinatorics, 10th Annual International Conference, COCOON 2004, Jeju Island, Korea, August 17-20, 2004, Proceedings, pp. 412-421, 2004, Springer, 3-540-22856-X. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
|
63 | Chung-Hao Chang, Cheng-Kuan Lin, Jimmy J. M. Tan, Hua-Min Huang, Lih-Hsing Hsu |
The super spanning connectivity and super spanning laceability of the enhanced hypercubes. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Supercomput. ![In: J. Supercomput. 48(1), pp. 66-87, 2009. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
Folded hypercubes, Enhanced hypercubes, Hamiltonian laceable, Super spanning connected, Super spanning laceable, Hamiltonian connected |
57 | Hong-Chun Hsu, Tseng-Kuei Li, Jimmy J. M. Tan, Lih-Hsing Hsu |
Fault Hamiltonicity and Fault Hamiltonian Connectivity of the Arrangement Graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Computers ![In: IEEE Trans. Computers 53(1), pp. 39-53, 2004. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
fault tolerance, Hamiltonian cycle, Hamiltonian connected, arrangement graph |
57 | Hong-Chun Hsu, Liang-Chih Chiang, Jimmy J. M. Tan, Lih-Hsing Hsu |
Ring Embedding in Faulty Augmented Cubes. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISPAN ![In: 7th International Symposium on Parallel Architectures, Algorithms, and Networks (I-SPAN 2004), 10-12 May 2004, Hong Kong, SAR, China, pp. 155-161, 2004, IEEE Computer Society, 0-7695-2135-5. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
augmented cubes, fault-tolerant, hamiltonian, hamiltonian connected |
54 | Mingchu Li |
Hamiltonian Connected Claw-Free Graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Graphs Comb. ![In: Graphs Comb. 20(3), pp. 341-362, 2004. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
|
34 | Deqiang Wang, Mingyang Pan, Tong An, Kelun Wang, Shuyan Qu |
Hamiltonian-like Properties of k-Ary n-Cubes. ![Search on Bibsonomy](Pics/bibsonomy.png) |
PDCAT ![In: Sixth International Conference on Parallel and Distributed Computing, Applications and Technologies (PDCAT 2005), 5-8 December 2005, Dalian, China, pp. 1002-1007, 2005, IEEE Computer Society, 0-7695-2405-2. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
|
31 | Sun-Yuan Hsieh |
Path Embedding on Folded Hypercubes. ![Search on Bibsonomy](Pics/bibsonomy.png) |
TAMC ![In: Theory and Applications of Models of Computation, 4th International Conference, TAMC 2007, Shanghai, China, May 22-25, 2007, Proceedings, pp. 750-759, 2007, Springer, 978-3-540-72503-9. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
|
31 | M. Reza HoseinyFarahabady, Hamid Sarbazi-Azad |
The Grid-Pyramid: A Generalized Pyramid Network. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Supercomput. ![In: J. Supercomput. 37(1), pp. 23-45, 2006. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
WK-recursive mesh, Hypermesh, Link-disjoint Hamiltonian cycles, Interconnection networks, Mesh, Torus, Hamiltonian cycle, Hamiltonian path, Pyramid, Hamiltonian-connectivity, Pancyclicity |
27 | Jan Ekstein, Herbert Fleischner |
The most general structure of graphs with hamiltonian or hamiltonian connected square. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Discret. Math. ![In: Discret. Math. 347(1), pp. 113702, January 2024. The full citation details ...](Pics/full.jpeg) |
2024 |
DBLP DOI BibTeX RDF |
|
27 | Yunshu Gao, Guojun Li, Jin Yan |
Notes on Hamiltonian Graphs and Hamiltonian-Connected Graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Ars Comb. ![In: Ars Comb. 109, pp. 405-414, 2013. The full citation details ...](Pics/full.jpeg) |
2013 |
DBLP BibTeX RDF |
|
27 | Y-Chuang Chen, Yong-Zen Huang, Lih-Hsing Hsu, Jimmy J. M. Tan |
A family of Hamiltonian and Hamiltonian connected graphs with fault tolerance. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Supercomput. ![In: J. Supercomput. 54(2), pp. 229-238, 2010. The full citation details ...](Pics/full.jpeg) |
2010 |
DBLP DOI BibTeX RDF |
|
27 | Yan Jin, Kewen Zhao, Hong-Jian Lai, Ju Zhou |
New Sufficient Conditions for s-Hamiltonian Graphs and s-Hamiltonian Connected Graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Ars Comb. ![In: Ars Comb. 88, 2008. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP BibTeX RDF |
|
27 | Wang Jian Zhong |
A generalization of Fan-type conditions for Hamiltonian and Hamiltonian-connected graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Australas. J Comb. ![In: Australas. J Comb. 8, pp. 267-276, 1993. The full citation details ...](Pics/full.jpeg) |
1993 |
DBLP BibTeX RDF |
|
26 | Tung-Yang Ho, Cheng-Kuan Lin, Jimmy J. M. Tan, Lih-Hsing Hsu |
Fault-Tolerant Hamiltonicity of the WK-Recursive Networks. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISPAN ![In: The 10th International Symposium on Pervasive Systems, Algorithms, and Networks, ISPAN 2009, Kaohsiung, Taiwan, December 14-16, 2009, pp. 592-595, 2009, IEEE Computer Society, 978-0-7695-3908-9. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
fault-tolerant hamiltonian, hamiltonian, hamiltonian connected |
26 | Chun-Nan Hung, Kao-Yung Liang, Lih-Hsing Hsu |
Embedding Hamiltonian Paths and Hamiltonian Cycles in Faulty Pancake Graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISPAN ![In: International Symposium on Parallel Architectures, Algorithms and Networks, ISPAN 2002, May 22-24, 2002, Makati City, Metro Manila, Philippines, pp. 179-184, 2002, IEEE Computer Society, 0-7695-1579-7. The full citation details ...](Pics/full.jpeg) |
2002 |
DBLP DOI BibTeX RDF |
fault tolerance, interconnection network, Hamiltonian-connectivity, Hamiltonian-connected, pancake graph |
24 | Petr Vrána, Xingzhi Zhan, Leilei Zhang |
Every 3-connected claw-free graph with domination number at most 3 is hamiltonian-connected. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Discret. Math. ![In: Discret. Math. 345(8), pp. 112909, 2022. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
24 | Xiaoyun Lu, Douglas B. West |
A new proof that 4-connected planar graphs are Hamiltonian-connected. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Discuss. Math. Graph Theory ![In: Discuss. Math. Graph Theory 36(3), pp. 555-564, 2016. The full citation details ...](Pics/full.jpeg) |
2016 |
DBLP DOI BibTeX RDF |
|
24 | Ken-ichi Kawarabayashi, Kenta Ozeki |
5-Connected Toroidal Graphs are Hamiltonian-Connected. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SIAM J. Discret. Math. ![In: SIAM J. Discret. Math. 30(1), pp. 112-140, 2016. The full citation details ...](Pics/full.jpeg) |
2016 |
DBLP DOI BibTeX RDF |
|
24 | Ken-ichi Kawarabayashi, Kenta Ozeki |
4-connected projective-planar graphs are Hamiltonian-connected. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Comb. Theory, Ser. B ![In: J. Comb. Theory, Ser. B 112, pp. 36-69, 2015. The full citation details ...](Pics/full.jpeg) |
2015 |
DBLP DOI BibTeX RDF |
|
24 | Qiuju Bian, Ronald J. Gould, Paul Horn, Susan Janiszewski, Steve La Fleur, Paul Wrayno |
3-Connected {K 1, 3, P 9}-Free Graphs are Hamiltonian-Connected. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Graphs Comb. ![In: Graphs Comb. 30(5), pp. 1099-1122, 2014. The full citation details ...](Pics/full.jpeg) |
2014 |
DBLP DOI BibTeX RDF |
|
24 | Ken-ichi Kawarabayashi, Kenta Ozeki |
4-connected projective-planar graphs are hamiltonian-connected. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SODA ![In: Proceedings of the Twenty-Fourth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2013, New Orleans, Louisiana, USA, January 6-8, 2013, pp. 378-395, 2013, SIAM, 978-1-61197-251-1. The full citation details ...](Pics/full.jpeg) |
2013 |
DBLP DOI BibTeX RDF |
|
24 | Hong-Jian Lai, Yehong Shao, Mingquan Zhan |
Every 4-connected line graph of a quasi claw-free graph is hamiltonian connected. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Discret. Math. ![In: Discret. Math. 308(22), pp. 5312-5316, 2008. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
|
24 | Matthias Kriesell |
All 4-connected Line Graphs of Claw Free Graphs Are Hamiltonian Connected. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Comb. Theory, Ser. B ![In: J. Comb. Theory, Ser. B 82(2), pp. 306-315, 2001. The full citation details ...](Pics/full.jpeg) |
2001 |
DBLP DOI BibTeX RDF |
|
22 | MohammadReza HoseinyFarahabady, Hamid Sarbazi-Azad |
On Pancyclicity Properties of OTIS Networks. ![Search on Bibsonomy](Pics/bibsonomy.png) |
HPCC ![In: High Performance Computing and Communications, Third International Conference, HPCC 2007, Houston, USA, September 26-28, 2007, Proceedings, pp. 545-553, 2007, Springer, 978-3-540-75443-5. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
|
17 | Alexandr V. Kostochka, Ruth Luo, Grace McCourt |
Minimum degree ensuring that a hypergraph is hamiltonian-connected. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Eur. J. Comb. ![In: Eur. J. Comb. 114, pp. 103782, December 2023. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
17 | Wei Zheng 0008, Hajo Broersma, Ligong Wang 0001 |
Toughness, forbidden subgraphs, and Hamiltonian-connected graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Discuss. Math. Graph Theory ![In: Discuss. Math. Graph Theory 42(1), pp. 187-196, 2022. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
17 | Ashok Kumar Das, Indrajit Paul |
On Hamiltonian-Connected and Mycielski graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/2206.02385, 2022. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
17 | Xingzhi Zhan |
The maximum degree of a minimally hamiltonian-connected graph. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Discret. Math. ![In: Discret. Math. 345(12), pp. 113159, 2022. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
17 | Jianping Liu, Aimei Yu, Keke Wang, Hong-Jian Lai |
Degree sum and hamiltonian-connected line graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Discret. Math. ![In: Discret. Math. 341(5), pp. 1363-1379, 2018. The full citation details ...](Pics/full.jpeg) |
2018 |
DBLP DOI BibTeX RDF |
|
17 | Zhenming Bi, Alexis Byers, Ping Zhang 0004 |
Proper Hamiltonian-Connected Graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Bull. ICA ![In: Bull. ICA 79, pp. 48-65, 2017. The full citation details ...](Pics/full.jpeg) |
2017 |
DBLP BibTeX RDF |
|
17 | Hsun Su, Yuan-Kang Shih, Shih-Yan Chen, Shin-Shin Kao |
A study on degree characterization for hamiltonian-connected graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Ars Comb. ![In: Ars Comb. 133, pp. 297-316, 2017. The full citation details ...](Pics/full.jpeg) |
2017 |
DBLP BibTeX RDF |
|
17 | Maliheh Modalleliyan, Behnaz Omoomi |
Critical Hamiltonian Connected Graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Ars Comb. ![In: Ars Comb. 126, pp. 13-27, 2016. The full citation details ...](Pics/full.jpeg) |
2016 |
DBLP BibTeX RDF |
|
17 | Michel Surmacs |
Weakly quasi-Hamiltonian-connected multipartite tournaments. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Discret. Math. ![In: Discret. Math. 339(2), pp. 597-605, 2016. The full citation details ...](Pics/full.jpeg) |
2016 |
DBLP DOI BibTeX RDF |
|
17 | Emlee W. Nicholson, Bing Wei 0001 |
Degree Sum Condition for k-ordered Hamiltonian Connected Graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Graphs Comb. ![In: Graphs Comb. 31(3), pp. 743-755, 2015. The full citation details ...](Pics/full.jpeg) |
2015 |
DBLP DOI BibTeX RDF |
|
17 | Kanagasabapathi Somasundaram, Juha Plosila, Nallasamy Viswanathan |
Deadlock free routing algorithm for minimizing congestion in a Hamiltonian connected recursive 3D-NoCs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Microelectron. J. ![In: Microelectron. J. 45(8), pp. 989-1000, 2014. The full citation details ...](Pics/full.jpeg) |
2014 |
DBLP DOI BibTeX RDF |
|
17 | Mei Lu, Yubao Guo, Michel Surmacs |
Strongly quasi-Hamiltonian-connected semicomplete multipartite digraphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Discret. Math. ![In: Discret. Math. 313(23), pp. 2667-2672, 2013. The full citation details ...](Pics/full.jpeg) |
2013 |
DBLP DOI BibTeX RDF |
|
17 | Tung-Yang Ho, Cheng-Kuan Lin, Jimmy J. M. Tan, D. Frank Hsu, Lih-Hsing Hsu |
On the extremal number of edges in hamiltonian connected graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Appl. Math. Lett. ![In: Appl. Math. Lett. 23(1), pp. 26-29, 2010. The full citation details ...](Pics/full.jpeg) |
2010 |
DBLP DOI BibTeX RDF |
|
17 | Tung-Yang Ho, Cheng-Kuan Lin, Jimmy J. M. Tan, Lih-Hsing Hsu |
Mutually orthogonal hamiltonian connected graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Appl. Math. Lett. ![In: Appl. Math. Lett. 22(9), pp. 1429-1431, 2009. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
|
17 | Kewen Zhao, Hong-Jian Lai, Ju Zhou |
Hamiltonian-connected graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Comput. Math. Appl. ![In: Comput. Math. Appl. 55(12), pp. 2707-2714, 2008. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
|
17 | Hong-Jian Lai, Yanting Liang, Yehong Shao |
On s-hamiltonian-connected line graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Discret. Math. ![In: Discret. Math. 308(18), pp. 4293-4297, 2008. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
|
17 | Dengxin Li, Hong-Jian Lai, Yehong Shao, Mingquan Zhan |
Hamiltonian connected hourglass free line graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Discret. Math. ![In: Discret. Math. 308(12), pp. 2634-2636, 2008. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
|
17 | Dyi-Rong Duh, Yi-Ching Chen, Ruei-Yu Wu |
Proof that pyramid networks are 1-Hamiltonian-connected with high probability. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Inf. Sci. ![In: Inf. Sci. 177(19), pp. 4188-4199, 2007. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
|
17 | Gerard J. Chang, Xuding Zhu |
Pseudo-Hamiltonian-connected graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Discret. Appl. Math. ![In: Discret. Appl. Math. 100(3), pp. 145-153, 2000. The full citation details ...](Pics/full.jpeg) |
2000 |
DBLP DOI BibTeX RDF |
|
17 | George R. T. Hendry, C. J. Knickerbocker, Patti Frazer Lock, Michael Sheard |
Forbidden subgraphs of graphs uniquely Hamiltonian-connected from a vertex. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Discret. Math. ![In: Discret. Math. 187(1-3), pp. 281-290, 1998. The full citation details ...](Pics/full.jpeg) |
1998 |
DBLP DOI BibTeX RDF |
|
17 | Yubao Guo |
Strongly Hamiltonian-connected locally semicomplete digraphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Graph Theory ![In: J. Graph Theory 22(1), pp. 65-73, 1996. The full citation details ...](Pics/full.jpeg) |
1996 |
DBLP DOI BibTeX RDF |
|
17 | Jørgen Bang-Jensen, Yubao Guo, Lutz Volkmann |
Weakly Hamiltonian-connected locally semicomplete digraphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Graph Theory ![In: J. Graph Theory 21(2), pp. 163-172, 1996. The full citation details ...](Pics/full.jpeg) |
1996 |
DBLP DOI BibTeX RDF |
|
17 | Jørgen Bang-Jensen, Gregory Z. Gutin, Jing Huang 0007 |
Weakly Hamiltonian-connected ordinary multipartite tournaments. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Discret. Math. ![In: Discret. Math. 138(1-3), pp. 63-74, 1995. The full citation details ...](Pics/full.jpeg) |
1995 |
DBLP DOI BibTeX RDF |
|
17 | Jørgen Bang-Jensen, Yannis Manoussakis |
Weakly Hamiltonian-Connected Vertices in Bipartite Tournaments. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Comb. Theory, Ser. B ![In: J. Comb. Theory, Ser. B 63(2), pp. 261-280, 1995. The full citation details ...](Pics/full.jpeg) |
1995 |
DBLP DOI BibTeX RDF |
|
17 | Luis D. Carrillo |
Hamiltonian-connected self-complementary graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Discret. Math. ![In: Discret. Math. 127(1-3), pp. 75-93, 1994. The full citation details ...](Pics/full.jpeg) |
1994 |
DBLP DOI BibTeX RDF |
|
17 | Ronald J. Gould, Xingxing Yu |
On hamiltonian-connected graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Graph Theory ![In: J. Graph Theory 18(8), pp. 841-860, 1994. The full citation details ...](Pics/full.jpeg) |
1994 |
DBLP DOI BibTeX RDF |
|
17 | C. J. Knickerbocker, Patti Frazer Lock, Michael Sheard |
On the structure of graphs uniquely hamiltonian-connected from a vertex. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Discret. Math. ![In: Discret. Math. 88(1), pp. 33-48, 1991. The full citation details ...](Pics/full.jpeg) |
1991 |
DBLP DOI BibTeX RDF |
|
17 | C. J. Knickerbocker, Patti Frazer Lock, Michael Sheard |
The minimum size of graphs hamiltonian-connected from a vertex. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Discret. Math. ![In: Discret. Math. 76(3), pp. 277-278, 1989. The full citation details ...](Pics/full.jpeg) |
1989 |
DBLP DOI BibTeX RDF |
|
17 | George R. T. Hendry |
The size of graphs uniquely hamiltonian-connected from a vertex. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Discret. Math. ![In: Discret. Math. 61(1), pp. 57-60, 1986. The full citation details ...](Pics/full.jpeg) |
1986 |
DBLP DOI BibTeX RDF |
|
17 | George R. T. Hendry |
Graphs uniquely hamiltonian-connected from a vertex. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Discret. Math. ![In: Discret. Math. 49(1), pp. 61-74, 1984. The full citation details ...](Pics/full.jpeg) |
1984 |
DBLP DOI BibTeX RDF |
|
17 | Ioan Tomescu |
On Hamiltonian-connected regular graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Graph Theory ![In: J. Graph Theory 7(4), pp. 429-436, 1983. The full citation details ...](Pics/full.jpeg) |
1983 |
DBLP DOI BibTeX RDF |
|
17 | Carsten Thomassen |
Hamiltonian-connected tournaments. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Comb. Theory, Ser. B ![In: J. Comb. Theory, Ser. B 28(2), pp. 142-163, 1980. The full citation details ...](Pics/full.jpeg) |
1980 |
DBLP DOI BibTeX RDF |
|
17 | Carsten Thomassen |
Counterexamples to faudree and schelp's conjecture on hamiltonian-connected graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Graph Theory ![In: J. Graph Theory 2(4), pp. 341-347, 1978. The full citation details ...](Pics/full.jpeg) |
1978 |
DBLP DOI BibTeX RDF |
|
12 | Jung-Sheng Fu |
Hamiltonian Connectedness of the Faulty WK-Recursive Network. ![Search on Bibsonomy](Pics/bibsonomy.png) |
PDCAT ![In: Seventh International Conference on Parallel and Distributed Computing, Applications and Technologies (PDCAT 2006), 4-7 December 2006, Taipei, Taiwan, pp. 96-101, 2006, IEEE Computer Society, 0-7695-2736-1. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
|
12 | Ronald J. Gould |
Advances on the Hamiltonian Problem - A Survey. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Graphs Comb. ![In: Graphs Comb. 19(1), pp. 7-52, 2003. The full citation details ...](Pics/full.jpeg) |
2003 |
DBLP DOI BibTeX RDF |
|
Displaying result #1 - #64 of 64 (100 per page; Change: )
|
|