Search results for "Hamiltonian-connected"

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.	J. Comb. Optim.	2007	DBLP DOI BibTeX RDF	Connectivity, Hamiltonian, Hamiltonian connected
89	Dengxin Li, Hong-Jian Lai, Yehong Shao, Mingquan Zhan	Hamiltonian Connected Line Graphs.	International Conference on Computational Science (3)	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.	IPDPS	2005	DBLP DOI BibTeX RDF
81	Jung-Sheng Fu	Hamiltonicity of the WK-Recursive Network with and without Faulty Nodes.	IEEE Trans. Parallel Distributed Syst.	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.	ISPAN	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.	COCOON	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.	J. Supercomput.	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.	IEEE Trans. Computers	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.	ISPAN	2004	DBLP DOI BibTeX RDF	augmented cubes, fault-tolerant, hamiltonian, hamiltonian connected
54	Mingchu Li	Hamiltonian Connected Claw-Free Graphs.	Graphs Comb.	2004	DBLP DOI BibTeX RDF
34	Deqiang Wang, Mingyang Pan, Tong An, Kelun Wang, Shuyan Qu	Hamiltonian-like Properties of k-Ary n-Cubes.	PDCAT	2005	DBLP DOI BibTeX RDF
31	Sun-Yuan Hsieh	Path Embedding on Folded Hypercubes.	TAMC	2007	DBLP DOI BibTeX RDF
31	M. Reza HoseinyFarahabady, Hamid Sarbazi-Azad	The Grid-Pyramid: A Generalized Pyramid Network.	J. Supercomput.	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.	Discret. Math.	2024	DBLP DOI BibTeX RDF
27	Yunshu Gao, Guojun Li, Jin Yan	Notes on Hamiltonian Graphs and Hamiltonian-Connected Graphs.	Ars Comb.	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.	J. Supercomput.	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.	Ars Comb.	2008	DBLP BibTeX RDF
27	Wang Jian Zhong	A generalization of Fan-type conditions for Hamiltonian and Hamiltonian-connected graphs.	Australas. J Comb.	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.	ISPAN	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.	ISPAN	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.	Discret. Math.	2022	DBLP DOI BibTeX RDF
24	Xiaoyun Lu, Douglas B. West	A new proof that 4-connected planar graphs are Hamiltonian-connected.	Discuss. Math. Graph Theory	2016	DBLP DOI BibTeX RDF
24	Ken-ichi Kawarabayashi, Kenta Ozeki	5-Connected Toroidal Graphs are Hamiltonian-Connected.	SIAM J. Discret. Math.	2016	DBLP DOI BibTeX RDF
24	Ken-ichi Kawarabayashi, Kenta Ozeki	4-connected projective-planar graphs are Hamiltonian-connected.	J. Comb. Theory, Ser. B	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.	Graphs Comb.	2014	DBLP DOI BibTeX RDF
24	Ken-ichi Kawarabayashi, Kenta Ozeki	4-connected projective-planar graphs are hamiltonian-connected.	SODA	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.	Discret. Math.	2008	DBLP DOI BibTeX RDF
24	Matthias Kriesell	All 4-connected Line Graphs of Claw Free Graphs Are Hamiltonian Connected.	J. Comb. Theory, Ser. B	2001	DBLP DOI BibTeX RDF
22	MohammadReza HoseinyFarahabady, Hamid Sarbazi-Azad	On Pancyclicity Properties of OTIS Networks.	HPCC	2007	DBLP DOI BibTeX RDF
17	Alexandr V. Kostochka, Ruth Luo, Grace McCourt	Minimum degree ensuring that a hypergraph is hamiltonian-connected.	Eur. J. Comb.	2023	DBLP DOI BibTeX RDF
17	Wei Zheng 0008, Hajo Broersma, Ligong Wang 0001	Toughness, forbidden subgraphs, and Hamiltonian-connected graphs.	Discuss. Math. Graph Theory	2022	DBLP DOI BibTeX RDF
17	Ashok Kumar Das, Indrajit Paul	On Hamiltonian-Connected and Mycielski graphs.	CoRR	2022	DBLP DOI BibTeX RDF
17	Xingzhi Zhan	The maximum degree of a minimally hamiltonian-connected graph.	Discret. Math.	2022	DBLP DOI BibTeX RDF
17	Jianping Liu, Aimei Yu, Keke Wang, Hong-Jian Lai	Degree sum and hamiltonian-connected line graphs.	Discret. Math.	2018	DBLP DOI BibTeX RDF
17	Zhenming Bi, Alexis Byers, Ping Zhang 0004	Proper Hamiltonian-Connected Graphs.	Bull. ICA	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.	Ars Comb.	2017	DBLP BibTeX RDF
17	Maliheh Modalleliyan, Behnaz Omoomi	Critical Hamiltonian Connected Graphs.	Ars Comb.	2016	DBLP BibTeX RDF
17	Michel Surmacs	Weakly quasi-Hamiltonian-connected multipartite tournaments.	Discret. Math.	2016	DBLP DOI BibTeX RDF
17	Emlee W. Nicholson, Bing Wei 0001	Degree Sum Condition for k-ordered Hamiltonian Connected Graphs.	Graphs Comb.	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.	Microelectron. J.	2014	DBLP DOI BibTeX RDF
17	Mei Lu, Yubao Guo, Michel Surmacs	Strongly quasi-Hamiltonian-connected semicomplete multipartite digraphs.	Discret. Math.	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.	Appl. Math. Lett.	2010	DBLP DOI BibTeX RDF
17	Tung-Yang Ho, Cheng-Kuan Lin, Jimmy J. M. Tan, Lih-Hsing Hsu	Mutually orthogonal hamiltonian connected graphs.	Appl. Math. Lett.	2009	DBLP DOI BibTeX RDF
17	Kewen Zhao, Hong-Jian Lai, Ju Zhou	Hamiltonian-connected graphs.	Comput. Math. Appl.	2008	DBLP DOI BibTeX RDF
17	Hong-Jian Lai, Yanting Liang, Yehong Shao	On s-hamiltonian-connected line graphs.	Discret. Math.	2008	DBLP DOI BibTeX RDF
17	Dengxin Li, Hong-Jian Lai, Yehong Shao, Mingquan Zhan	Hamiltonian connected hourglass free line graphs.	Discret. Math.	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.	Inf. Sci.	2007	DBLP DOI BibTeX RDF
17	Gerard J. Chang, Xuding Zhu	Pseudo-Hamiltonian-connected graphs.	Discret. Appl. Math.	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.	Discret. Math.	1998	DBLP DOI BibTeX RDF
17	Yubao Guo	Strongly Hamiltonian-connected locally semicomplete digraphs.	J. Graph Theory	1996	DBLP DOI BibTeX RDF
17	Jørgen Bang-Jensen, Yubao Guo, Lutz Volkmann	Weakly Hamiltonian-connected locally semicomplete digraphs.	J. Graph Theory	1996	DBLP DOI BibTeX RDF
17	Jørgen Bang-Jensen, Gregory Z. Gutin, Jing Huang 0007	Weakly Hamiltonian-connected ordinary multipartite tournaments.	Discret. Math.	1995	DBLP DOI BibTeX RDF
17	Jørgen Bang-Jensen, Yannis Manoussakis	Weakly Hamiltonian-Connected Vertices in Bipartite Tournaments.	J. Comb. Theory, Ser. B	1995	DBLP DOI BibTeX RDF
17	Luis D. Carrillo	Hamiltonian-connected self-complementary graphs.	Discret. Math.	1994	DBLP DOI BibTeX RDF
17	Ronald J. Gould, Xingxing Yu	On hamiltonian-connected graphs.	J. Graph Theory	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.	Discret. Math.	1991	DBLP DOI BibTeX RDF
17	C. J. Knickerbocker, Patti Frazer Lock, Michael Sheard	The minimum size of graphs hamiltonian-connected from a vertex.	Discret. Math.	1989	DBLP DOI BibTeX RDF
17	George R. T. Hendry	The size of graphs uniquely hamiltonian-connected from a vertex.	Discret. Math.	1986	DBLP DOI BibTeX RDF
17	George R. T. Hendry	Graphs uniquely hamiltonian-connected from a vertex.	Discret. Math.	1984	DBLP DOI BibTeX RDF
17	Ioan Tomescu	On Hamiltonian-connected regular graphs.	J. Graph Theory	1983	DBLP DOI BibTeX RDF
17	Carsten Thomassen	Hamiltonian-connected tournaments.	J. Comb. Theory, Ser. B	1980	DBLP DOI BibTeX RDF
17	Carsten Thomassen	Counterexamples to faudree and schelp's conjecture on hamiltonian-connected graphs.	J. Graph Theory	1978	DBLP DOI BibTeX RDF
12	Jung-Sheng Fu	Hamiltonian Connectedness of the Faulty WK-Recursive Network.	PDCAT	2006	DBLP DOI BibTeX RDF
12	Ronald J. Gould	Advances on the Hamiltonian Problem - A Survey.	Graphs Comb.	2003	DBLP DOI BibTeX RDF