Néraud, Jean Loopless algorithms to generate maximum length Gray cycles wrt. \(k\)-character substitutions. (English) Zbl 07751514 Theor. Comput. Sci. 977, Article ID 114175, 23 p. (2023). MSC: 68Qxx PDFBibTeX XMLCite \textit{J. Néraud}, Theor. Comput. Sci. 977, Article ID 114175, 23 p. (2023; Zbl 07751514) Full Text: DOI arXiv
Gishboliner, Lior; Krivelevich, Michael; Michaeli, Peleg Oriented discrepancy of Hamilton cycles. (English) Zbl 1522.05261 J. Graph Theory 103, No. 4, 780-792 (2023). MSC: 05C45 PDFBibTeX XMLCite \textit{L. Gishboliner} et al., J. Graph Theory 103, No. 4, 780--792 (2023; Zbl 1522.05261) Full Text: DOI arXiv OA License
Dong, Xiaoyuan; Lin, Yuquan; Lin, Wensong The injective chromatic index of a claw-free subcubic graph is at most 6. (English) Zbl 07723581 J. Math. Res. Appl. 43, No. 4, 409-416 (2023). MSC: 05C15 PDFBibTeX XMLCite \textit{X. Dong} et al., J. Math. Res. Appl. 43, No. 4, 409--416 (2023; Zbl 07723581) Full Text: DOI
Renjith, P.; Sadagopan, N. 2-trees: structural insights and the study of Hamiltonian paths. (English) Zbl 1516.05111 Discrete Math. Algorithms Appl. 15, No. 4, Article ID 2250113, 24 p. (2023). MSC: 05C38 05C45 05C85 PDFBibTeX XMLCite \textit{P. Renjith} and \textit{N. Sadagopan}, Discrete Math. Algorithms Appl. 15, No. 4, Article ID 2250113, 24 p. (2023; Zbl 1516.05111) Full Text: DOI arXiv
Kreh, Martin A note on Hamiltonian cycles in planar graphs. (English) Zbl 1516.05114 Discrete Math. Algorithms Appl. 15, No. 1, Article ID 2250060, 5 p. (2023). MSC: 05C45 05C10 11D04 PDFBibTeX XMLCite \textit{M. Kreh}, Discrete Math. Algorithms Appl. 15, No. 1, Article ID 2250060, 5 p. (2023; Zbl 1516.05114) Full Text: DOI
Renjith, P.; Sadagopan, N. Hamiltonian cycle in \(K_{1,r}\)-free split graphs – a dichotomy. (English) Zbl 1522.68420 Int. J. Found. Comput. Sci. 33, No. 1, 1-32 (2022). MSC: 68R10 05C38 05C45 05C85 68Q17 68Q25 PDFBibTeX XMLCite \textit{P. Renjith} and \textit{N. Sadagopan}, Int. J. Found. Comput. Sci. 33, No. 1, 1--32 (2022; Zbl 1522.68420) Full Text: DOI
Chen, Ming Hamilton-connected, vertex-pancyclic and bipartite holes. (English) Zbl 1497.05137 Discrete Math. 345, No. 12, Article ID 113158, 6 p. (2022). MSC: 05C45 05C40 05C38 05C07 PDFBibTeX XMLCite \textit{M. Chen}, Discrete Math. 345, No. 12, Article ID 113158, 6 p. (2022; Zbl 1497.05137) Full Text: DOI
Gan, Zhiyong; Xu, Yanping Hamiltonian and long paths in bipartite graphs with connectivity. (English) Zbl 1497.05138 Discrete Math. 345, No. 12, Article ID 113083, 18 p. (2022). MSC: 05C45 05C12 05C40 PDFBibTeX XMLCite \textit{Z. Gan} and \textit{Y. Xu}, Discrete Math. 345, No. 12, Article ID 113083, 18 p. (2022; Zbl 1497.05138) Full Text: DOI
Adler, Isolde; Köhler, Noleen An explicit construction of graphs of bounded degree that are far from being Hamiltonian. (English) Zbl 1490.05145 Discrete Math. Theor. Comput. Sci. 24, No. 1, Paper No. 3, 19 p. (2022). MSC: 05C45 05C07 PDFBibTeX XMLCite \textit{I. Adler} and \textit{N. Köhler}, Discrete Math. Theor. Comput. Sci. 24, No. 1, Paper No. 3, 19 p. (2022; Zbl 1490.05145) Full Text: DOI arXiv
Dai, Guowei; Zhang, Zan-Bo; Broersma, Hajo; Zhang, Xiaoyan The Hamiltonian properties in \(K_{1,r}\)-free split graphs. (English) Zbl 1486.05169 Discrete Math. 345, No. 6, Article ID 112826, 7 p. (2022). MSC: 05C45 PDFBibTeX XMLCite \textit{G. Dai} et al., Discrete Math. 345, No. 6, Article ID 112826, 7 p. (2022; Zbl 1486.05169) Full Text: DOI
Zhang, Zan-Bo; Zhang, Xiaoyan; Gutin, Gregory; Lou, Dingjun Hamiltonicity, pancyclicity, and full cycle extendability in multipartite tournaments. (English) Zbl 1522.05171 J. Graph Theory 96, No. 2, 171-191 (2021). Reviewer: William G. Brown (Montréal) MSC: 05C20 PDFBibTeX XMLCite \textit{Z.-B. Zhang} et al., J. Graph Theory 96, No. 2, 171--191 (2021; Zbl 1522.05171) Full Text: DOI
Chiba, Shuya; Fujisawa, Jun Induced nets and Hamiltonicity of claw-free graphs. (English) Zbl 1475.05101 Graphs Comb. 37, No. 3, 663-690 (2021). Reviewer: Hang Lau (Montréal) MSC: 05C45 05C38 05C75 05C40 PDFBibTeX XMLCite \textit{S. Chiba} and \textit{J. Fujisawa}, Graphs Comb. 37, No. 3, 663--690 (2021; Zbl 1475.05101) Full Text: DOI arXiv
Gan, Zhiyong; Xu, Yanping Hamiltonian and long cycles in bipartite graphs with connectivity. (English) Zbl 1466.05114 Discrete Appl. Math. 301, 49-64 (2021). MSC: 05C45 05C38 05C12 05C40 05C70 PDFBibTeX XMLCite \textit{Z. Gan} and \textit{Y. Xu}, Discrete Appl. Math. 301, 49--64 (2021; Zbl 1466.05114) Full Text: DOI
Chartrand, Gary; Zhang, Ping Uniformly connected graphs – a survey. (English) Zbl 1490.05137 Parallel Process. Lett. 30, No. 3, Article ID 2040002, 16 p. (2020). MSC: 05C40 PDFBibTeX XMLCite \textit{G. Chartrand} and \textit{P. Zhang}, Parallel Process. Lett. 30, No. 3, Article ID 2040002, 16 p. (2020; Zbl 1490.05137) Full Text: DOI
Zhang, Xinhong; Li, Ruijuan The H-force sets of the graphs satisfying the condition of Ore’s theorem. (English) Zbl 1475.05032 Open Math. 18, 771-780 (2020). MSC: 05C07 05C45 PDFBibTeX XMLCite \textit{X. Zhang} and \textit{R. Li}, Open Math. 18, 771--780 (2020; Zbl 1475.05032) Full Text: DOI arXiv
Li, Binlong Bipartite independent number and Hamilton-biconnectedness of bipartite graphs. (English) Zbl 1459.05150 Graphs Comb. 36, No. 6, 1639-1653 (2020). MSC: 05C45 05C69 PDFBibTeX XMLCite \textit{B. Li}, Graphs Comb. 36, No. 6, 1639--1653 (2020; Zbl 1459.05150) Full Text: DOI
Bucić, Matija; Jahn, Erik; Pokrovskiy, Alexey; Sudakov, Benny 2-factors with \(k\) cycles in Hamiltonian graphs. (English) Zbl 1443.05106 J. Comb. Theory, Ser. B 144, 150-166 (2020). MSC: 05C45 05C38 05C07 PDFBibTeX XMLCite \textit{M. Bucić} et al., J. Comb. Theory, Ser. B 144, 150--166 (2020; Zbl 1443.05106) Full Text: DOI arXiv
Choi, Ilkyoo; Kim, Jinha A sharp Ore-type condition for a connected graph with no induced star to have a Hamiltonian path. (English) Zbl 1442.05119 Discrete Appl. Math. 279, 178-182 (2020). Reviewer: William Kocay (Howden) MSC: 05C45 PDFBibTeX XMLCite \textit{I. Choi} and \textit{J. Kim}, Discrete Appl. Math. 279, 178--182 (2020; Zbl 1442.05119) Full Text: DOI arXiv
Abrosimov, M. B. Comparison of sufficient degree based conditions for Hamiltonian graph. (Russian. English summary) Zbl 1459.05146 Prikl. Diskretn. Mat. 2019, No. 45, 55-63 (2019). MSC: 05C45 05C30 PDFBibTeX XMLCite \textit{M. B. Abrosimov}, Prikl. Diskretn. Mat. 2019, No. 45, 55--63 (2019; Zbl 1459.05146) Full Text: DOI MNR
Li, Rao The hyper-Zagreb index and some Hamiltonian properties of graphs. (English) Zbl 1438.05059 DML, Discrete Math. Lett. 1, 54-58 (2019). MSC: 05C09 05C07 05C38 05C45 PDFBibTeX XMLCite \textit{R. Li}, DML, Discrete Math. Lett. 1, 54--58 (2019; Zbl 1438.05059) Full Text: Link
Abrosimov, Mikhail Borisovich On a Goodman-Hedetniemi sufficient condition for graph Hamiltonicity. (Russian. English summary) Zbl 1406.05058 Izv. Sarat. Univ. (N.S.), Ser. Mat. Mekh. Inform. 18, No. 3, 347-353 (2018). MSC: 05C45 PDFBibTeX XMLCite \textit{M. B. Abrosimov}, Izv. Sarat. Univ. (N.S.), Ser. Mat. Mekh. Inform. 18, No. 3, 347--353 (2018; Zbl 1406.05058) Full Text: DOI MNR
Momège, Benjamin Connected graph \(G\) with \(\sigma_2(G) \geq \frac{2}{3} n\) and \(K_{1, 4}\)-free contains a Hamiltonian path. (English) Zbl 1394.05063 Discrete Appl. Math. 247, 37-42 (2018). MSC: 05C40 05C45 05C60 PDFBibTeX XMLCite \textit{B. Momège}, Discrete Appl. Math. 247, 37--42 (2018; Zbl 1394.05063) Full Text: DOI
Mütze, Torsten; Su, Pascal Bipartite Kneser graphs are Hamiltonian. (English) Zbl 1399.05135 Combinatorica 37, No. 6, 1207-1219 (2017). Reviewer: David B. Penman (Colchester) MSC: 05C38 05C45 PDFBibTeX XMLCite \textit{T. Mütze} and \textit{P. Su}, Combinatorica 37, No. 6, 1207--1219 (2017; Zbl 1399.05135) Full Text: DOI arXiv
Larson, C. E.; Van Cleemput, N. Automated conjecturing. III. Property-relations conjectures. (English) Zbl 1379.68275 Ann. Math. Artif. Intell. 81, No. 3-4, 315-327 (2017). MSC: 68T15 05C45 05C69 PDFBibTeX XMLCite \textit{C. E. Larson} and \textit{N. Van Cleemput}, Ann. Math. Artif. Intell. 81, No. 3--4, 315--327 (2017; Zbl 1379.68275) Full Text: DOI
Renjith, P.; Sadagopan, N. Hamiltonicity in split graphs – a dichotomy. (English) Zbl 1485.68199 Gaur, Daya (ed.) et al., Algorithms and discrete applied mathematics. Third international conference, CALDAM 2017, Sancoale, Goa, India, February 16–18, 2017. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 10156, 320-331 (2017). MSC: 68R10 05C45 68Q17 68W05 68W40 PDFBibTeX XMLCite \textit{P. Renjith} and \textit{N. Sadagopan}, Lect. Notes Comput. Sci. 10156, 320--331 (2017; Zbl 1485.68199) Full Text: DOI arXiv
Momège, Benjamin Sufficient conditions for a connected graph to have a Hamiltonian path. (English) Zbl 1450.05051 Steffen, Bernhard (ed.) et al., SOFSEM 2017: theory and practice of computer science. 43rd international conference on current trends in theory and practice of computer science, Limerick, Ireland, January 16–20, 2017, Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 10139, 205-216 (2017). MSC: 05C45 05C40 PDFBibTeX XMLCite \textit{B. Momège}, Lect. Notes Comput. Sci. 10139, 205--216 (2017; Zbl 1450.05051) Full Text: DOI
Borozan, Valentin; Ferrara, Michael; Fujita, Shinya; Furuya, Michitaka; Manoussakis, Yannis; N., Narayanan; Stolee, Derrick Partitioning a graph into highly connected subgraphs. (English) Zbl 1342.05110 J. Graph Theory 82, No. 3, 322-333 (2016). MSC: 05C70 05C40 PDFBibTeX XMLCite \textit{V. Borozan} et al., J. Graph Theory 82, No. 3, 322--333 (2016; Zbl 1342.05110) Full Text: DOI arXiv
Larson, C. E.; Van Cleemput, N. Automated conjecturing. I: Fajtlowicz’s Dalmatian heuristic revisited. (English) Zbl 1344.68208 Artif. Intell. 231, 17-38 (2016). MSC: 68T15 68T20 PDFBibTeX XMLCite \textit{C. E. Larson} and \textit{N. Van Cleemput}, Artif. Intell. 231, 17--38 (2016; Zbl 1344.68208) Full Text: DOI
Mütze, Torsten; Su, Pascal Bipartite Kneser graphs are Hamiltonian. (English) Zbl 1346.05154 Nešetril, Jaroslav (ed.) et al., Extended abstracts of the eight European conference on combinatorics, graph theory and applications, EuroComb 2015, Bergen, Norway, August 31 – September 4, 2015. Amsterdam: Elsevier. Electronic Notes in Discrete Mathematics 49, 259-267, electronic only (2015). MSC: 05C45 05C65 PDFBibTeX XMLCite \textit{T. Mütze} and \textit{P. Su}, Electron. Notes Discrete Math. 49, 259--267 (2015; Zbl 1346.05154) Full Text: DOI Link
Gould, Ronald J. Recent advances on the Hamiltonian problem: survey III. (English) Zbl 1292.05163 Graphs Comb. 30, No. 1, 1-46 (2014). MSC: 05C45 05-02 PDFBibTeX XMLCite \textit{R. J. Gould}, Graphs Comb. 30, No. 1, 1--46 (2014; Zbl 1292.05163) Full Text: DOI
Diemunsch, Jennifer; Ferrara, Michael; Graffeo, Samantha; Morris, Timothy On 2-factors with a bounded number of odd components. (English) Zbl 1283.05146 Discrete Math. 323, 35-42 (2014). MSC: 05C38 05C70 PDFBibTeX XMLCite \textit{J. Diemunsch} et al., Discrete Math. 323, 35--42 (2014; Zbl 1283.05146) Full Text: DOI
Li, Hao Generalizations of Dirac’s theorem in Hamiltonian graph theory – a survey. (English) Zbl 1277.05100 Discrete Math. 313, No. 19, 2034-2053 (2013). MSC: 05C45 05C38 PDFBibTeX XMLCite \textit{H. Li}, Discrete Math. 313, No. 19, 2034--2053 (2013; Zbl 1277.05100) Full Text: DOI
Sun, Chao-Ming Bipanconnectivity of faulty hypercubes with minimum degree. (English) Zbl 1242.05194 Appl. Math. Comput. 218, No. 9, 5518-5523 (2012). MSC: 05C65 05C45 05C40 PDFBibTeX XMLCite \textit{C.-M. Sun}, Appl. Math. Comput. 218, No. 9, 5518--5523 (2012; Zbl 1242.05194) Full Text: DOI
Broersma, H. J.; Ryjáček, Z.; Vrána, P. How many conjectures can you stand? A survey. (English) Zbl 1234.05146 Graphs Comb. 28, No. 1, 57-75 (2012). MSC: 05C45 05C38 05C35 PDFBibTeX XMLCite \textit{H. J. Broersma} et al., Graphs Comb. 28, No. 1, 57--75 (2012; Zbl 1234.05146) Full Text: DOI Link
Zhao, Kewen; Li, Zu; Chen, Deqin New sufficient condition and Hamiltonian and traceable. (English) Zbl 1252.05106 J. Discrete Math. Sci. Cryptography 14, No. 6, 597-602 (2011). MSC: 05C45 PDFBibTeX XMLCite \textit{K. Zhao} et al., J. Discrete Math. Sci. Cryptography 14, No. 6, 597--602 (2011; Zbl 1252.05106) Full Text: DOI Link
Gordon, Valery S.; Orlovich, Yury L.; Potts, Chris N.; Strusevich, Vitaly A. Hamiltonian properties of locally connected graphs with bounded vertex degree. (English) Zbl 1228.05200 Discrete Appl. Math. 159, No. 16, 1759-1774 (2011). MSC: 05C45 PDFBibTeX XMLCite \textit{V. S. Gordon} et al., Discrete Appl. Math. 159, No. 16, 1759--1774 (2011; Zbl 1228.05200) Full Text: DOI
Nikoghosyan, Zh. G. Graph invariants and large cycles: a survey. (English) Zbl 1213.05221 Int. J. Math. Math. Sci. 2011, Article ID 206404, 11 p. (2011). MSC: 05C75 05C38 05C45 05C69 PDFBibTeX XMLCite \textit{Zh. G. Nikoghosyan}, Int. J. Math. Math. Sci. 2011, Article ID 206404, 11 p. (2011; Zbl 1213.05221) Full Text: DOI EuDML
Vallée, Thierry; Bretto, Alain A new closure concept preserving graph Hamiltonicity and based on neighborhood equivalence. (English) Zbl 1222.05126 Discrete Math. 311, No. 5, 336-341 (2011). MSC: 05C38 05C45 PDFBibTeX XMLCite \textit{T. Vallée} and \textit{A. Bretto}, Discrete Math. 311, No. 5, 336--341 (2011; Zbl 1222.05126) Full Text: DOI HAL
Vallée, Thierry Normal Eulerian clique-covering and hamiltonicity. (English) Zbl 1233.05161 Inf. Process. Lett. 110, No. 16, 697-701 (2010). MSC: 05C70 05C69 05C45 PDFBibTeX XMLCite \textit{T. Vallée}, Inf. Process. Lett. 110, No. 16, 697--701 (2010; Zbl 1233.05161) Full Text: DOI
Keevash, Peter; Sudakov, Benny Pancyclicity of Hamiltonian and highly connected graphs. (English) Zbl 1208.05071 J. Comb. Theory, Ser. B 100, No. 5, 456-467 (2010). Reviewer: Michael Hager (Leonberg) MSC: 05C45 05C38 PDFBibTeX XMLCite \textit{P. Keevash} and \textit{B. Sudakov}, J. Comb. Theory, Ser. B 100, No. 5, 456--467 (2010; Zbl 1208.05071) Full Text: DOI arXiv
Dvořák, Zdeněk; Král’, Daniel; Teska, Jakub Toughness threshold for the existence of 2-walks in \(K_{4}\)-minor-free graphs. (English) Zbl 1283.05154 Discrete Math. 310, No. 3, 642-651 (2010). MSC: 05C42 05C83 PDFBibTeX XMLCite \textit{Z. Dvořák} et al., Discrete Math. 310, No. 3, 642--651 (2010; Zbl 1283.05154) Full Text: DOI
Bretto, Alain; Vallée, Thierry A clique-covering sufficient condition for hamiltonicity of graphs. (English) Zbl 1197.05083 Inf. Process. Lett. 109, No. 20, 1156-1160 (2009). MSC: 05C45 05C69 05C70 05C85 PDFBibTeX XMLCite \textit{A. Bretto} and \textit{T. Vallée}, Inf. Process. Lett. 109, No. 20, 1156--1160 (2009; Zbl 1197.05083) Full Text: DOI HAL
Král’, Daniel; Stacho, Ladislav Hamiltonian threshold for strong products of graphs. (English) Zbl 1194.05071 J. Graph Theory 58, No. 4, 314-328 (2008). MSC: 05C45 05C76 PDFBibTeX XMLCite \textit{D. Král'} and \textit{L. Stacho}, J. Graph Theory 58, No. 4, 314--328 (2008; Zbl 1194.05071) Full Text: DOI
Saito, Akira Chvátal-Erdős theorem: Old theorem with new aspects. (English) Zbl 1162.05331 Ito, Hiro (ed.) et al., Computational geometry and graph theory. International conference, KyotoCGGT 2007, Kyoto, Japan, June 11–15, 2007. Revised selected papers. Berlin: Springer (ISBN 978-3-540-89549-7/pbk). Lecture Notes in Computer Science 4535, 191-200 (2008). MSC: 05C45 05C40 05C69 PDFBibTeX XMLCite \textit{A. Saito}, Lect. Notes Comput. Sci. 4535, 191--200 (2008; Zbl 1162.05331) Full Text: DOI
Konstantinova, Elena Some problems on Cayley graphs. (English) Zbl 1148.05037 Linear Algebra Appl. 429, No. 11-12, 2754-2769 (2008). MSC: 05C25 05C45 05C12 05E15 05-03 01A55 01A60 01A61 01A65 PDFBibTeX XMLCite \textit{E. Konstantinova}, Linear Algebra Appl. 429, No. 11--12, 2754--2769 (2008; Zbl 1148.05037) Full Text: DOI
Li, Shengjia; Li, Ruijuan; Feng, Jinfeng An efficient condition for a graph to be Hamiltonian. (English) Zbl 1123.05060 Discrete Appl. Math. 155, No. 14, 1842-1845 (2007). MSC: 05C45 PDFBibTeX XMLCite \textit{S. Li} et al., Discrete Appl. Math. 155, No. 14, 1842--1845 (2007; Zbl 1123.05060) Full Text: DOI
Byer, Owen D.; Smeltzer, Deirdre L. Edge bounds in nonhamiltonian \(k\)-connected graphs. (English) Zbl 1123.05051 Discrete Math. 307, No. 13, 1572-1579 (2007). Reviewer: Lai Chunhui (Zhangzhou) MSC: 05C35 05C45 PDFBibTeX XMLCite \textit{O. D. Byer} and \textit{D. L. Smeltzer}, Discrete Math. 307, No. 13, 1572--1579 (2007; Zbl 1123.05051) Full Text: DOI
Plummer, Michael D. Graph factors and factorization: 1985–2003: a survey. (English) Zbl 1112.05088 Discrete Math. 307, No. 7-8, 791-821 (2007). MSC: 05C70 05-02 PDFBibTeX XMLCite \textit{M. D. Plummer}, Discrete Math. 307, No. 7--8, 791--821 (2007; Zbl 1112.05088) Full Text: DOI
Dimakopoulos, Vassilios V.; Palios, Leonidas; Poulakidas, Athanasios S. On the hamiltonicity of the Cartesian product. (English) Zbl 1191.68464 Inf. Process. Lett. 96, No. 2, 49-53 (2005). MSC: 68R10 68M10 PDFBibTeX XMLCite \textit{V. V. Dimakopoulos} et al., Inf. Process. Lett. 96, No. 2, 49--53 (2005; Zbl 1191.68464) Full Text: DOI
Král’, Daniel; Maxová, Jana; Šámal, Robert; Podbrdský, Pavel Hamilton cycles in strong products of graphs. (English) Zbl 1062.05087 J. Graph Theory 48, No. 4, 299-321 (2005). MSC: 05C45 PDFBibTeX XMLCite \textit{D. Král'} et al., J. Graph Theory 48, No. 4, 299--321 (2005; Zbl 1062.05087) Full Text: DOI
Stacho, Ladislav; Szeszlér, Dávid On a generalization of Chvátal’s condition giving new Hamiltonian degree sequences. (English) Zbl 1059.05068 Discrete Math. 292, No. 1-3, 159-165 (2005). MSC: 05C45 05C07 PDFBibTeX XMLCite \textit{L. Stacho} and \textit{D. Szeszlér}, Discrete Math. 292, No. 1--3, 159--165 (2005; Zbl 1059.05068) Full Text: DOI
Park, Chong-Dae; Chwa, Kyung-Yong Hamiltonian properties on the class of hypercube-like networks. (English) Zbl 1178.68043 Inf. Process. Lett. 91, No. 1, 11-17 (2004). MSC: 68M10 PDFBibTeX XMLCite \textit{C.-D. Park} and \textit{K.-Y. Chwa}, Inf. Process. Lett. 91, No. 1, 11--17 (2004; Zbl 1178.68043) Full Text: DOI
Wong, Pak-Ken An algorithm for finding longest cycles in certain bipartite graphs. (English) Zbl 1320.05132 Int. J. Found. Comput. Sci. 12, No. 4, 445-454 (2001). MSC: 05C85 05C38 PDFBibTeX XMLCite \textit{P.-K. Wong}, Int. J. Found. Comput. Sci. 12, No. 4, 445--454 (2001; Zbl 1320.05132) Full Text: DOI
Stacho, Ladislav Locally pancyclic graphs. (English) Zbl 0929.05047 J. Comb. Theory, Ser. B 76, No. 1, 22-40 (1999). Reviewer: R.J.Faudree (Memphis) MSC: 05C38 05C45 PDFBibTeX XMLCite \textit{L. Stacho}, J. Comb. Theory, Ser. B 76, No. 1, 22--40 (1999; Zbl 0929.05047) Full Text: DOI
Chen, Beifang; Zhou, Sanming Domination number and neighbourhood conditions. (English) Zbl 0934.05096 Discrete Math. 195, No. 1-3, 81-91 (1999). Reviewer: Bohdan Zelinka (Liberec) MSC: 05C69 05C35 PDFBibTeX XMLCite \textit{B. Chen} and \textit{S. Zhou}, Discrete Math. 195, No. 1--3, 81--91 (1999; Zbl 0934.05096) Full Text: DOI
Chinburg, Ted; Savage, Carla D.; Wilf, Herbert S. Combinatorial families that are exponentially far from being listable in Gray code sequence. (English) Zbl 0918.05107 Trans. Am. Math. Soc. 351, No. 1, 379-402 (1999). Reviewer: A.Kapralski (Kraków) MSC: 05E99 05C45 05A05 68R05 68R10 94B25 11C08 11L03 PDFBibTeX XMLCite \textit{T. Chinburg} et al., Trans. Am. Math. Soc. 351, No. 1, 379--402 (1999; Zbl 0918.05107) Full Text: DOI
Stacho, Ladislav A new Chvátal type condition for pancyclicity. (English) Zbl 0938.05038 Graphs Comb. 13, No. 3, 275-280 (1997). MSC: 05C38 05C45 PDFBibTeX XMLCite \textit{L. Stacho}, Graphs Comb. 13, No. 3, 275--280 (1997; Zbl 0938.05038) Full Text: DOI
Gravier, Sylvain Hamiltonicity of the cross product of two Hamiltonian graphs. (English) Zbl 0876.05063 Discrete Math. 170, No. 1-3, 253-257 (1997). MSC: 05C45 PDFBibTeX XMLCite \textit{S. Gravier}, Discrete Math. 170, No. 1--3, 253--257 (1997; Zbl 0876.05063) Full Text: DOI
Faudree, Ralph; Flandrin, Evelyne; Ryjáček, Zdeněk Claw-free graphs—a survey. (English) Zbl 0879.05043 Discrete Math. 164, No. 1-3, 87-147 (1997). Reviewer: K.R.Parthasarathy (Narayanapuram) MSC: 05C38 05C45 05C70 05C85 05-02 PDFBibTeX XMLCite \textit{R. Faudree} et al., Discrete Math. 164, No. 1--3, 87--147 (1997; Zbl 0879.05043) Full Text: DOI
Feldmann, R.; Mysliwietz, P. The shuffle exchange network has a Hamiltonian path. (English) Zbl 0861.68006 Math. Syst. Theory 29, No. 5, 471-485 (1996). MSC: 68M10 PDFBibTeX XMLCite \textit{R. Feldmann} and \textit{P. Mysliwietz}, Math. Syst. Theory 29, No. 5, 471--485 (1996; Zbl 0861.68006) Full Text: DOI
Polický, Ivan A sufficient condition for Hamiltonian graphs. (English) Zbl 0838.05078 Math. Slovaca 45, No. 2, 115-119 (1995). Reviewer: M.Škoviera (Bratislava) MSC: 05C45 PDFBibTeX XMLCite \textit{I. Polický}, Math. Slovaca 45, No. 2, 115--119 (1995; Zbl 0838.05078) Full Text: EuDML
Ryjáček, Zdeněk Hamiltonicity in claw-free graphs through induced bulls. (English) Zbl 0823.05040 Discrete Math. 140, No. 1-3, 141-147 (1995). Reviewer: C.-Q.Zhang (Morgantown) MSC: 05C45 PDFBibTeX XMLCite \textit{Z. Ryjáček}, Discrete Math. 140, No. 1--3, 141--147 (1995; Zbl 0823.05040) Full Text: DOI
Ageev, A. A. Dominating sets and Hamiltonicity in \(K_{1,3}\)-free graphs. (English. Russian original) Zbl 0852.05062 Sib. Math. J. 35, No. 3, 421-425 (1994); translation from Sib. Mat. Zh. 35, No. 3, 475-479 (1994). MSC: 05C45 05C35 PDFBibTeX XMLCite \textit{A. A. Ageev}, Sib. Math. J. 35, No. 3, 421--425 (1994; Zbl 0852.05062); translation from Sib. Mat. Zh. 35, No. 3, 475--479 (1994) Full Text: DOI
Hurlbert, Glenn The antipodal layers problem. (English) Zbl 0817.05042 Discrete Math. 128, No. 1-3, 237-245 (1994). MSC: 05C45 05C70 PDFBibTeX XMLCite \textit{G. Hurlbert}, Discrete Math. 128, No. 1--3, 237--245 (1994; Zbl 0817.05042) Full Text: DOI
Feldmann, Rainer; Mysliwietz, Peter The shuffle exchange network has a Hamiltonian path. (English) Zbl 1494.68193 Havel, Ivan M. (ed.) et al., Mathematical foundations of computer science 1992. 17th international symposium, Prague, Czechoslovakia, August 24–28, 1992. Proceedings. Berlin: Springer. Lect. Notes Comput. Sci. 629, 246-254 (1992). MSC: 68R10 05C45 PDFBibTeX XMLCite \textit{R. Feldmann} and \textit{P. Mysliwietz}, Lect. Notes Comput. Sci. 629, 246--254 (1992; Zbl 1494.68193) Full Text: DOI