Liu, Juan; Yang, Hong; Lai, Hong-Jian; Zhang, Xindong Symmetric core and spanning trails in directed networks. (English) Zbl 1472.05140 Discrete Math. 344, No. 11, Article ID 112584, 10 p. (2021). MSC: 05C82 05C45 05C20 PDF BibTeX XML Cite \textit{J. Liu} et al., Discrete Math. 344, No. 11, Article ID 112584, 10 p. (2021; Zbl 1472.05140) Full Text: DOI OpenURL
Shao, Yehong; Yan, Huiya On \(s\)-fully cycle extendable line graphs. (English) Zbl 1468.05252 Australas. J. Comb. 80, Part 3, 386-400 (2021). MSC: 05C76 05C45 05C38 PDF BibTeX XML Cite \textit{Y. Shao} and \textit{H. Yan}, Australas. J. Comb. 80, Part 3, 386--400 (2021; Zbl 1468.05252) Full Text: Link OpenURL
Long, Shude Enumeration of rooted planar near-4-regular eulerian trails. (English) Zbl 07442433 Ars Comb. 150, 201-212 (2020). MSC: 05C45 05C30 PDF BibTeX XML Cite \textit{S. Long}, Ars Comb. 150, 201--212 (2020; Zbl 07442433) OpenURL
Glock, Stefan; Joos, Felix; Kühn, Daniela; Osthus, Deryk Euler tours in hypergraphs. (English) Zbl 1474.05287 Combinatorica 40, No. 5, 679-690 (2020). Reviewer: Esther R. Lamken (San Francisco) MSC: 05C65 05B40 05C45 05C81 PDF BibTeX XML Cite \textit{S. Glock} et al., Combinatorica 40, No. 5, 679--690 (2020; Zbl 1474.05287) Full Text: DOI arXiv OpenURL
Bergougnoux, Benjamin; Kanté, Mamadou Moustapha; Kwon, O-joung An optimal XP algorithm for Hamiltonian cycle on graphs of bounded clique-width. (English) Zbl 1433.68279 Algorithmica 82, No. 6, 1654-1674 (2020). MSC: 68R10 05C38 05C45 05C85 68W40 PDF BibTeX XML Cite \textit{B. Bergougnoux} et al., Algorithmica 82, No. 6, 1654--1674 (2020; Zbl 1433.68279) Full Text: DOI arXiv OpenURL
Galeana-Sánchez, Hortensia; Rojas-Monroy, Rocío; Sánchez-López, Rocío; Villarreal-Valdés, Juana Imelda Some conditions for the existence of Euler \(H\)-trails. (English) Zbl 1429.05066 Graphs Comb. 35, No. 5, 1197-1208 (2019). Reviewer: Juan José Montellano Ballesteros (Coyoacán) MSC: 05C15 05C45 05C38 PDF BibTeX XML Cite \textit{H. Galeana-Sánchez} et al., Graphs Comb. 35, No. 5, 1197--1208 (2019; Zbl 1429.05066) Full Text: DOI OpenURL
Tian, Tao; Xiong, Liming Traceability on 2-connected line graphs. (English) Zbl 1426.05075 Appl. Math. Comput. 321, 463-471 (2018). MSC: 05C38 05C45 05C75 05C40 PDF BibTeX XML Cite \textit{T. Tian} and \textit{L. Xiong}, Appl. Math. Comput. 321, 463--471 (2018; Zbl 1426.05075) Full Text: DOI OpenURL
Dong, Changchang; Liu, Juan Supereulerian extended digraphs. (English) Zbl 1413.05138 J. Math. Res. Appl. 38, No. 2, 111-120 (2018). MSC: 05C20 05C45 PDF BibTeX XML Cite \textit{C. Dong} and \textit{J. Liu}, J. Math. Res. Appl. 38, No. 2, 111--120 (2018; Zbl 1413.05138) Full Text: DOI OpenURL
Azimi, A.; Farrokhi D. G., M. Cycles and paths in Jacobson graphs. (English) Zbl 06837008 Ars Comb. 134, 61-74 (2017). Reviewer: Linda Lesniak (Kalamazoo) MSC: 05C45 16P10 13H99 16N20 PDF BibTeX XML Cite \textit{A. Azimi} and \textit{M. Farrokhi D. G.}, Ars Comb. 134, 61--74 (2017; Zbl 06837008) Full Text: arXiv OpenURL
Chen, Guantao; Ellingham, M. N.; Saito, Akira; Shan, Songling Spanning trails with maximum degree at most 4 in \(2K_2\)-free graphs. (English) Zbl 1377.05098 Graphs Comb. 33, No. 5, 1095-1101 (2017). Reviewer: Iztok Peterin (Maribor) MSC: 05C42 05C45 PDF BibTeX XML Cite \textit{G. Chen} et al., Graphs Comb. 33, No. 5, 1095--1101 (2017; Zbl 1377.05098) Full Text: DOI arXiv OpenURL
Burris, Christie S.; Motta, Francis C.; Shipman, Patrick D. An unoriented variation on de Bruijn sequences. (English) Zbl 1371.05004 Graphs Comb. 33, No. 4, 845-858 (2017). MSC: 05A05 11B83 05C45 PDF BibTeX XML Cite \textit{C. S. Burris} et al., Graphs Comb. 33, No. 4, 845--858 (2017; Zbl 1371.05004) Full Text: DOI arXiv OpenURL
Chen, Zhi-Hong Hamiltonicity and degrees of adjacent vertices in claw-free graphs. (English) Zbl 1370.05124 J. Graph Theory 86, No. 2, 193-212 (2017). MSC: 05C45 05C07 PDF BibTeX XML Cite \textit{Z.-H. Chen}, J. Graph Theory 86, No. 2, 193--212 (2017; Zbl 1370.05124) Full Text: DOI OpenURL
Lv, Shengmei; Xiong, Liming Forbidden pairs for spanning (closed) trails. (English) Zbl 1357.05105 Discrete Math. 340, No. 5, 1012-1018 (2017); erratum ibid. 341, No. 4, 1192-1193 (2018). MSC: 05C60 05C45 05C38 05C40 PDF BibTeX XML Cite \textit{S. Lv} and \textit{L. Xiong}, Discrete Math. 340, No. 5, 1012--1018 (2017; Zbl 1357.05105) Full Text: DOI OpenURL
Chen, Zhi-Hong; Lai, Hong-Jian; Zhang, Meng Spanning trails with variations of Chvátal-Erdős conditions. (English) Zbl 1351.05169 Discrete Math. 340, No. 2, 243-251 (2017). MSC: 05C69 05C70 PDF BibTeX XML Cite \textit{Z.-H. Chen} et al., Discrete Math. 340, No. 2, 243--251 (2017; Zbl 1351.05169) Full Text: DOI OpenURL
Ariannejad, M. A graph theoretical equivalence for Amitsur-Levitzki theorem. (English) Zbl 1352.05076 Linear Multilinear Algebra 64, No. 12, 2486-2490 (2016). MSC: 05C20 05C45 05C62 05B20 PDF BibTeX XML Cite \textit{M. Ariannejad}, Linear Multilinear Algebra 64, No. 12, 2486--2490 (2016; Zbl 1352.05076) Full Text: DOI OpenURL
Makarovskikh, Tat’jana Anatol’evna On the number of \(OE\)-trails for a fixed transition system. (Russian. English summary) Zbl 1336.05065 Vestn. Yuzhno-Ural. Gos. Univ., Ser. Mat., Mekh., Fiz. 8, No. 1, 5-12 (2016). MSC: 05C30 05C10 05C45 05C38 PDF BibTeX XML Cite \textit{T. A. Makarovskikh}, Vestn. Yuzhno-Ural. Gos. Univ., Ser. Mat., Mekh., Fiz. 8, No. 1, 5--12 (2016; Zbl 1336.05065) OpenURL
Hanada, Hiroyuki; Denzumi, Shuhei; Inoue, Yuma; Aoki, Hiroshi; Yasuda, Norihito; Takeuchi, Shogo; Minato, Shin-ichi Enumerating Eulerian trails via Hamiltonian path enumeration. (English) Zbl 1435.05106 Rahman, M. Sohel (ed.) et al., WALCOM: algorithms and computation. 9th international workshop, WALCOM 2015, Dhaka, Bangladesh, February 26–28, 2015. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 8973, 161-174 (2015). MSC: 05C30 05C45 05C38 68P05 PDF BibTeX XML Cite \textit{H. Hanada} et al., Lect. Notes Comput. Sci. 8973, 161--174 (2015; Zbl 1435.05106) Full Text: DOI OpenURL
Niu, Zhaohong; Xiong, Liming On traceable line graphs. (English) Zbl 1306.05207 Graphs Comb. 31, No. 1, 221-233 (2015). MSC: 05C76 05C45 05C40 PDF BibTeX XML Cite \textit{Z. Niu} and \textit{L. Xiong}, Graphs Comb. 31, No. 1, 221--233 (2015; Zbl 1306.05207) Full Text: DOI OpenURL
Li, Feng; Liang, Dong; Xu, Zongben On the Euler property of the lexicographic product of graphs. (Chinese. English summary) Zbl 1313.05217 Chin. J. Eng. Math. 31, No. 3, 317-323 (2014). MSC: 05C45 05C38 05C76 PDF BibTeX XML Cite \textit{F. Li} et al., Chin. J. Eng. Math. 31, No. 3, 317--323 (2014; Zbl 1313.05217) Full Text: DOI OpenURL
Aldred, R. E. L.; Bailey, R. A.; McKay, Brendan D.; Wanless, Ian M. Circular designs balanced for neighbours at distances one and two. (English) Zbl 1306.62179 Biometrika 101, No. 4, 943-956 (2014). MSC: 62K05 05B05 PDF BibTeX XML Cite \textit{R. E. L. Aldred} et al., Biometrika 101, No. 4, 943--956 (2014; Zbl 1306.62179) Full Text: DOI Link OpenURL
Xu, Jinquan; Chen, Zhi-Hong; Lai, Hong-Jian; Zhang, Meng Spanning trails in essentially 4-edge-connected graphs. (English) Zbl 1300.05154 Discrete Appl. Math. 162, 306-313 (2014). MSC: 05C40 PDF BibTeX XML Cite \textit{J. Xu} et al., Discrete Appl. Math. 162, 306--313 (2014; Zbl 1300.05154) Full Text: DOI OpenURL
Niu, Zhaohong; Xiong, Liming Smallest \(k\)-edge-connected claw-free graphs without special spanning trails. (English) Zbl 1293.05192 Util. Math. 93, 233-248 (2014). MSC: 05C40 05C38 05C15 05C76 PDF BibTeX XML Cite \textit{Z. Niu} and \textit{L. Xiong}, Util. Math. 93, 233--248 (2014; Zbl 1293.05192) OpenURL
Detti, Paolo; Meloni, Carlo; Pranzo, Marco A lower bound on the Hamiltonian path completion number of a line graph. (English) Zbl 1329.05251 Appl. Math. Comput. 220, 296-304 (2013). MSC: 05C76 05C45 PDF BibTeX XML Cite \textit{P. Detti} et al., Appl. Math. Comput. 220, 296--304 (2013; Zbl 1329.05251) Full Text: DOI OpenURL
Li, Hao; Yang, Weihua A note on collapsible graphs and super-Eulerian graphs. (English) Zbl 1246.05096 Discrete Math. 312, No. 15, 2223-2227 (2012). MSC: 05C45 05C76 PDF BibTeX XML Cite \textit{H. Li} and \textit{W. Yang}, Discrete Math. 312, No. 15, 2223--2227 (2012; Zbl 1246.05096) Full Text: DOI OpenURL
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 PDF BibTeX XML Cite \textit{H. J. Broersma} et al., Graphs Comb. 28, No. 1, 57--75 (2012; Zbl 1234.05146) Full Text: DOI OpenURL
Panyukova, T. A. Optimal Eulerian coverings with ordered enclosing for planar graphs. (Russian) Zbl 1249.05238 Diskretn. Anal. Issled. Oper. 18, No. 2, 64-74 (2011). MSC: 05C45 05C10 05C85 PDF BibTeX XML Cite \textit{T. A. Panyukova}, Diskretn. Anal. Issled. Oper. 18, No. 2, 64--74 (2011; Zbl 1249.05238) OpenURL
Lai, Hong-Jian; Yan, Huiya Supereulerian graphs and matchings. (English) Zbl 1234.05147 Appl. Math. Lett. 24, No. 11, 1867-1869 (2011). MSC: 05C45 05C69 05C70 PDF BibTeX XML Cite \textit{H.-J. Lai} and \textit{H. Yan}, Appl. Math. Lett. 24, No. 11, 1867--1869 (2011; Zbl 1234.05147) Full Text: DOI OpenURL
Broersma, Hajo; Fomin, Fedor V.; van ’t Hof, Pim; Paulusma, Daniël Fast exact algorithms for Hamiltonicity in claw-free graphs. (English) Zbl 1273.05216 Paul, Christophe (ed.) et al., Graph-theoretic concepts in computer science. 35th international workshop, WG 2009, Montpellier, France, June 24–26, 2009. Revised papers. Berlin: Springer (ISBN 978-3-642-11408-3/pbk). Lecture Notes in Computer Science 5911, 44-53 (2010). MSC: 05C85 05C45 05C69 68Q17 68Q25 PDF BibTeX XML Cite \textit{H. Broersma} et al., Lect. Notes Comput. Sci. 5911, 44--53 (2010; Zbl 1273.05216) Full Text: DOI OpenURL
Gourvès, Laurent; Lyra, Adria; Martinhon, Carlos; Monnot, Jérôme; Protti, Fábio On \(s\)–\(t\) paths and trails in edge-colored graphs. (English) Zbl 1268.05112 Liebling, Thomas M. (ed.) et al., LAGOS’09 – V Latin-American algorithms, graphs, and optimization symposium. Papers from the symposium, Gramado, Brazil, November 3–7, 2009. Amsterdam: Elsevier. Electronic Notes in Discrete Mathematics 35, 221-226 (2009). MSC: 05C38 05C15 05C85 PDF BibTeX XML Cite \textit{L. Gourvès} et al., Electron. Notes Discrete Math. 35, 221--226 (2009; Zbl 1268.05112) Full Text: DOI OpenURL
Xiong, Liming; Zong, Minmin Traceability of line graphs. (English) Zbl 1218.05085 Discrete Math. 309, No. 12, 3779-3785 (2009). MSC: 05C45 05C76 05C38 PDF BibTeX XML Cite \textit{L. Xiong} and \textit{M. Zong}, Discrete Math. 309, No. 12, 3779--3785 (2009; Zbl 1218.05085) Full Text: DOI OpenURL
An, Xinhui; Liu, Xiaoping All 2-connected claw-free graphs with diameter at most two are Hamiltonian. (English) Zbl 1199.05200 OR Trans. 12, No. 4, 19-24 (2008). MSC: 05C45 PDF BibTeX XML Cite \textit{X. An} and \textit{X. Liu}, OR Trans. 12, No. 4, 19--24 (2008; Zbl 1199.05200) OpenURL
Li, Qiang; Xie, Huimin Finite automata for testing composition-based reconstructibility of sequences. (English) Zbl 1140.68035 J. Comput. Syst. Sci. 74, No. 5, 870-874 (2008). MSC: 68Q45 PDF BibTeX XML Cite \textit{Q. Li} and \textit{H. Xie}, J. Comput. Syst. Sci. 74, No. 5, 870--874 (2008; Zbl 1140.68035) Full Text: DOI arXiv OpenURL
Horňák, Mirko; Kocková, Zuzana On complete tripartite graphs arbitrarily decomposable into closed trails. (English) Zbl 1174.05073 Tatra Mt. Math. Publ. 36, 71-107 (2007). MSC: 05C45 PDF BibTeX XML Cite \textit{M. Horňák} and \textit{Z. Kocková}, Tatra Mt. Math. Publ. 36, 71--107 (2007; Zbl 1174.05073) OpenURL
Detti, Paolo; Meloni, Carlo; Pranzo, Marco Local search algorithms for finding the Hamiltonian completion number of line graphs. (English) Zbl 1130.05056 Ann. Oper. Res. 156, 5-24 (2007). MSC: 05C85 05C45 68R10 PDF BibTeX XML Cite \textit{P. Detti} et al., Ann. Oper. Res. 156, 5--24 (2007; Zbl 1130.05056) Full Text: DOI OpenURL
Hu, Zhiquan; Tian, Feng; Wei, Bing Hamilton connectivity of line graphs and claw-free graphs. (English) Zbl 1079.05051 J. Graph Theory 50, No. 2, 130-141 (2005). Reviewer: Hang Tong Lau (Montréal) MSC: 05C45 PDF BibTeX XML Cite \textit{Z. Hu} et al., J. Graph Theory 50, No. 2, 130--141 (2005; Zbl 1079.05051) Full Text: DOI OpenURL
Li, Xiaomin; Li, Dengxin A method to probe to the number of edges of spanning Eulerian subgraphs. (Chinese. English summary) Zbl 1067.05045 Chin. J. Eng. Math. 21, No. 6, 1018-1020, 1036 (2004). MSC: 05C45 PDF BibTeX XML Cite \textit{X. Li} and \textit{D. Li}, Chin. J. Eng. Math. 21, No. 6, 1018--1020, 1036 (2004; Zbl 1067.05045) OpenURL
Ellingham, M. N.; Zha, Xiaoya; Zhang, Yi Spanning 2-trails from degree sum conditions. (English) Zbl 1034.05031 J. Graph Theory 45, No. 4, 298-319 (2004). MSC: 05C45 05C70 PDF BibTeX XML Cite \textit{M. N. Ellingham} et al., J. Graph Theory 45, No. 4, 298--319 (2004; Zbl 1034.05031) Full Text: DOI OpenURL
Balister, Paul Packing digraphs with directed closed trails. (English) Zbl 1015.05072 Comb. Probab. Comput. 12, No. 1, 1-15 (2003). Reviewer: Zbigniew Lonc (Warszawa) MSC: 05C70 05C20 05C45 PDF BibTeX XML Cite \textit{P. Balister}, Comb. Probab. Comput. 12, No. 1, 1--15 (2003; Zbl 1015.05072) Full Text: DOI OpenURL
Zhang, Jing; Xiong, Liming Supereulerian graphs in 3-edge-connected graphs. (Chinese. English summary) Zbl 1013.05045 J. Jiangxi Norm. Univ., Nat. Sci. Ed. 26, No. 1, 37-39 (2002). MSC: 05C45 PDF BibTeX XML Cite \textit{J. Zhang} and \textit{L. Xiong}, J. Jiangxi Norm. Univ., Nat. Sci. Ed. 26, No. 1, 37--39 (2002; Zbl 1013.05045) OpenURL
Chen, Zhi-Zhong; He, Xin; Huang, Chun-Hsi Finding double Euler trails of planar graphs in linear time. (English) Zbl 0996.05086 SIAM J. Comput. 31, No. 4, 1255-1285 (2002). MSC: 05C45 05C85 05C90 68W35 68R10 PDF BibTeX XML Cite \textit{Z.-Z. Chen} et al., SIAM J. Comput. 31, No. 4, 1255--1285 (2002; Zbl 0996.05086) Full Text: DOI OpenURL
Harborth, Heiko Eulerian straight ahead cycles in drawings of complete bipartite graphs. (English) Zbl 0984.05026 Discrete Math. 230, No. 1-3, 45-48 (2001). Reviewer: Herbert Fleischner (Wien) MSC: 05C10 05C45 05C38 PDF BibTeX XML Cite \textit{H. Harborth}, Discrete Math. 230, No. 1--3, 45--48 (2001; Zbl 0984.05026) Full Text: DOI OpenURL
Lai, Hong-Jian; Zhang, Xiankun Spanning trails that join given edges in 3-edge-connected graphs. (English) Zbl 1064.05095 Ars Comb. 57, 301-318 (2000). MSC: 05C45 05C40 PDF BibTeX XML Cite \textit{H.-J. Lai} and \textit{X. Zhang}, Ars Comb. 57, 301--318 (2000; Zbl 1064.05095) OpenURL
Andersen, Lars Døvling; Fleischner, Herbert; Regner, Susanne Algorithms and outerplanar conditions for \(A\)-trails in plane Eulerian graphs. (English) Zbl 0904.05060 Discrete Appl. Math. 85, No. 2, 99-112 (1998). Reviewer: G.Gutin (Odense) MSC: 05C45 68Q25 05C85 PDF BibTeX XML Cite \textit{L. D. Andersen} et al., Discrete Appl. Math. 85, No. 2, 99--112 (1998; Zbl 0904.05060) Full Text: DOI Link OpenURL
Boza, L.; Diánez, A.; Márquez, A.; Quintero, A. A link between Menger’s theorem and infinite Euler graphs. (English) Zbl 0924.05046 Acta Math. Hung. 74, No. 1-2, 41-46 (1997). MSC: 05C45 PDF BibTeX XML Cite \textit{L. Boza} et al., Acta Math. Hung. 74, No. 1--2, 41--46 (1997; Zbl 0924.05046) Full Text: DOI OpenURL
Grossman, Jerrold W. Dominating sets whose closed stars form spanning trees. (English) Zbl 0876.05045 Discrete Math. 169, No. 1-3, 83-94 (1997). Reviewer: B.Zelinka (Liberec) MSC: 05C35 05C05 05C45 05C85 68R10 90B18 PDF BibTeX XML Cite \textit{J. W. Grossman}, Discrete Math. 169, No. 1--3, 83--94 (1997; Zbl 0876.05045) Full Text: DOI OpenURL
Neumann-Lara, Víctor; Rivera-Campo, Eduardo Euler tours and a game with dominoes. (English) Zbl 0882.05086 Discrete Math. 167-168, 511-517 (1997). Reviewer: G.Schaar (Freiberg) MSC: 05C45 05C70 91A46 PDF BibTeX XML Cite \textit{V. Neumann-Lara} and \textit{E. Rivera-Campo}, Discrete Math. 167--168, 511--517 (1997; Zbl 0882.05086) Full Text: DOI OpenURL
Catlin, Paul A.; Han, Zheng-Yiao; Lai, Hong-Jian Graphs without spanning closed trails. (English) Zbl 0859.05060 Discrete Math. 160, No. 1-3, 81-91 (1996). MSC: 05C45 05C05 PDF BibTeX XML Cite \textit{P. A. Catlin} et al., Discrete Math. 160, No. 1--3, 81--91 (1996; Zbl 0859.05060) Full Text: DOI OpenURL
Andersen, Lars Døvling; Fleischner, Herbert The NP-completeness of finding A-trails in Eulerian graphs and of finding spanning trees in hypergraphs. (English) Zbl 0823.68044 Discrete Appl. Math. 59, No. 3, 203-214 (1995). Reviewer: Ma Zhongfan (Beijing) MSC: 68Q25 05C65 68R10 05C45 05C05 PDF BibTeX XML Cite \textit{L. D. Andersen} and \textit{H. Fleischner}, Discrete Appl. Math. 59, No. 3, 203--214 (1995; Zbl 0823.68044) Full Text: DOI OpenURL
Cai, Mao-cheng; Fleischner, Herbert An eulerian trail traversing specified edges in given order. (English) Zbl 0856.05062 J. Graph Theory 19, No. 2, 137-144 (1995). MSC: 05C45 PDF BibTeX XML Cite \textit{M.-c. Cai} and \textit{H. Fleischner}, J. Graph Theory 19, No. 2, 137--144 (1995; Zbl 0856.05062) Full Text: DOI OpenURL
Lai, Hong-Jian; Zhang, Cun-Quan Hamiltonian connected line graphs. (English) Zbl 0821.05037 Ars Comb. 38, 193-202 (1994). Reviewer: P.Sekanina (Fairbanks) MSC: 05C45 05C40 PDF BibTeX XML Cite \textit{H.-J. Lai} and \textit{C.-Q. Zhang}, Ars Comb. 38, 193--202 (1994; Zbl 0821.05037) OpenURL
Cai, Mao-Cheng An algorithm for an Eulerian trail traversing specified edges in given order. (English) Zbl 0811.05042 Discrete Appl. Math. 55, No. 3, 233-239 (1994). Reviewer: M.Middendorf (Karlsruhe) MSC: 05C45 05C85 05C40 68R10 PDF BibTeX XML Cite \textit{M.-C. Cai}, Discrete Appl. Math. 55, No. 3, 233--239 (1994; Zbl 0811.05042) Full Text: DOI OpenURL
Gao, Zhicheng; Wormald, Nicholas C. Spanning Eulerian subgraphs of bounded degree in triangulations. (English) Zbl 0804.05026 Graphs Comb. 10, No. 2, 123-131 (1994). Reviewer: S.Mihalas (Columbus / Ohio) MSC: 05C10 05C45 PDF BibTeX XML Cite \textit{Z. Gao} and \textit{N. C. Wormald}, Graphs Comb. 10, No. 2, 123--131 (1994; Zbl 0804.05026) Full Text: DOI OpenURL
Fleischner, Herbert Uniqueness of maximal dominating cycles in 3-regular graphs and of Hamiltonian cycles in 4-regular graphs. (English) Zbl 0807.05050 J. Graph Theory 18, No. 5, 449-459 (1994). Reviewer: R.Scapellato (Milano) MSC: 05C45 05C38 PDF BibTeX XML Cite \textit{H. Fleischner}, J. Graph Theory 18, No. 5, 449--459 (1994; Zbl 0807.05050) Full Text: DOI OpenURL
Chen, Zhi-Hong Spanning closed trails in graphs. (English) Zbl 0782.05052 Discrete Math. 117, No. 1-3, 57-71 (1993). Reviewer: Ján Plesník (Bratislava) MSC: 05C38 05C70 05C45 PDF BibTeX XML Cite \textit{Z.-H. Chen}, Discrete Math. 117, No. 1--3, 57--71 (1993; Zbl 0782.05052) Full Text: DOI OpenURL
Catlin, Paul A.; Lai, Hong-Jian Spanning trails joining two given edges. (English) Zbl 0841.05067 Alavi, Yousef (ed.) et al., Graph theory, combinatorics, and applications, Vol. 1. Proceedings of the sixth quadrennial international conference on the theory and applications of graphs held at Western Michigan University, Kalamazoo, Michigan, May 30-June 3, 1988. New York: John Wiley & Sons Ltd. Wiley-Interscience Publication. 207-222 (1991). MSC: 05C45 05C05 05C38 PDF BibTeX XML Cite \textit{P. A. Catlin} and \textit{H.-J. Lai}, in: Graph theory, combinatorics, and applications, Vol. 1. Proceedings of the sixth quadrennial international conference on the theory and applications of graphs held at Western Michigan University, Kalamazoo, Michigan, May 30-June 3, 1988. New York: John Wiley \&| Sons Ltd.. 207--222 (1991; Zbl 0841.05067) OpenURL
Catlin, Paul A.; Lai, Hong-Jian Supereulerian graphs and the Petersen graph. (English) Zbl 0723.05081 J. Comb. Theory, Ser. B (to appear). Reviewer: P.A.Catlin (Detroit) MSC: 05C45 05C40 PDF BibTeX XML OpenURL
Fleischner, Herbert Eulerian graphs and related topics. Part 1, Volume 1. (English) Zbl 0792.05091 Annals of Discrete Mathematics. 45. Amsterdam etc.: North-Holland. xiii, 402 p. (1990). MSC: 05C45 PDF BibTeX XML Cite \textit{H. Fleischner}, Eulerian graphs and related topics. Part 1, Volume 1. Amsterdam etc.: North-Holland (1990; Zbl 0792.05091) OpenURL
Škoviera, Martin; Nedela, Roman The maximum genus of a graph and doubly Eulerian trails. (English) Zbl 0715.05018 Boll. Unione Mat. Ital., VII. Ser., B 4, No. 3, 541-551 (1990). Reviewer: A.T.White MSC: 05C10 PDF BibTeX XML Cite \textit{M. Škoviera} and \textit{R. Nedela}, Boll. Unione Mat. Ital., VII. Ser., B 4, No. 3, 541--551 (1990; Zbl 0715.05018) OpenURL
Catlin, Paul A.; Lai, Hong-Jian Eulerian subgraphs in graphs with short cycles. (English) Zbl 0751.05064 Ars Comb. 30, 177-191 (1990). Reviewer: J.Mitchem (San José) MSC: 05C45 05C38 PDF BibTeX XML Cite \textit{P. A. Catlin} and \textit{H.-J. Lai}, Ars Comb. 30, 177--191 (1990; Zbl 0751.05064) OpenURL
Basangova, E. O. Existence of an Eulerian mixed cycle in a partially directed graph. (Russian) Zbl 0722.05046 Mat. Zametki 46, No. 4, 110-112 (1989). Reviewer: P.Horák (Bratislava) MSC: 05C45 05C20 PDF BibTeX XML Cite \textit{E. O. Basangova}, Mat. Zametki 46, No. 4, 110--112 (1989; Zbl 0722.05046) OpenURL
Cai, Xiaotao A sufficient condition of minimum degree for a graph to have an S- circuit. (Chinese) Zbl 0717.05053 Chin. Ann. Math., Ser. A 10, No. 3, 373-378 (1989). Reviewer: Hao Li MSC: 05C45 05C35 05C38 PDF BibTeX XML Cite \textit{X. Cai}, Chin. Ann. Math., Ser. A 10, No. 3, 373--378 (1989; Zbl 0717.05053) OpenURL
Fleischner, Herbert; Wenger, Emanuel D\({}_ 0\)-favouring Eulerian trails in digraphs. (English) Zbl 0708.05027 Arch. Math., Brno 25, No. 1-2, 55-60 (1989). MSC: 05C20 05C45 PDF BibTeX XML Cite \textit{H. Fleischner} and \textit{E. Wenger}, Arch. Math., Brno 25, No. 1--2, 55--60 (1989; Zbl 0708.05027) Full Text: EuDML OpenURL
Yang, Yaochang Diconnected orientation of mixed graph. (Chinese. English summary) Zbl 0682.05042 J. East China Norm. Univ., Nat. Sci. Ed. 1988, No. 1, 24-29 (1988). MSC: 05C40 05C38 PDF BibTeX XML Cite \textit{Y. Yang}, J. East China Norm. Univ., Nat. Sci. Ed. 1988, No. 1, 24--29 (1988; Zbl 0682.05042) OpenURL
McKee, T. A. The clique/kernel analog of Eulerian. (English) Zbl 0681.05039 Graph theory, 250th Anniv. Conf., Lafayette/Indiana 1986, Congr. Numerantium 64, 171-178 (1988). Reviewer: P.Horák MSC: 05C35 05C45 PDF BibTeX XML OpenURL
Ebert, Jürgen Computing Eulerian trails. (English) Zbl 0658.68076 Inf. Process. Lett. 28, No. 2, 93-97 (1988). MSC: 68R10 68Q25 05C45 05C38 PDF BibTeX XML Cite \textit{J. Ebert}, Inf. Process. Lett. 28, No. 2, 93--97 (1988; Zbl 0658.68076) Full Text: DOI OpenURL
Paulraja, P. On graphs admitting spanning eulerian subgraphs. (English) Zbl 0662.05044 Ars Comb. 24, 57-65 (1987). Reviewer: N.Wormald MSC: 05C45 05C38 PDF BibTeX XML Cite \textit{P. Paulraja}, Ars Comb. 24, 57--65 (1987; Zbl 0662.05044) OpenURL
Catlin, Paul A. Spanning trails. (English) Zbl 0662.05039 J. Graph Theory 11, No. 2, 161-167 (1987). Reviewer: Ján Plesník (Bratislava) MSC: 05C38 05C45 PDF BibTeX XML Cite \textit{P. A. Catlin}, J. Graph Theory 11, No. 2, 161--167 (1987; Zbl 0662.05039) Full Text: DOI OpenURL
Fleischner, Herbert; Jackson, Bill Compatible path-cycle-decompositions of plane graphs. (English) Zbl 0605.05023 J. Comb. Theory, Ser. B 42, 94-121 (1987). Reviewer: O.Oellermann MSC: 05C45 05C38 05C10 PDF BibTeX XML Cite \textit{H. Fleischner} and \textit{B. Jackson}, J. Comb. Theory, Ser. B 42, 94--121 (1987; Zbl 0605.05023) Full Text: DOI OpenURL
Benhocine, A.; Clark, L.; Köhler, N.; Veldman, H. J. On circuits and pancyclic line graphs. (English) Zbl 0608.05056 J. Graph Theory 10, No. 3, 411-425 (1986). Reviewer: Ján Plesník (Bratislava) MSC: 05C45 05C38 05C99 PDF BibTeX XML Cite \textit{A. Benhocine} et al., J. Graph Theory 10, No. 3, 411--425 (1986; Zbl 0608.05056) Full Text: DOI Link OpenURL
Veldman, H. J. Existence of spanning and dominating trails and circuits. (English) Zbl 0594.05043 J. Graph Theory 10, No. 1, 23-31 (1986). Reviewer: R.L.Hemminger MSC: 05C45 05C38 PDF BibTeX XML Cite \textit{H. J. Veldman}, J. Graph Theory 10, No. 1, 23--31 (1986; Zbl 0594.05043) Full Text: DOI Link OpenURL
Brenner, J. L.; Lyndon, R. C. Doubly Eulerian trails on rectangular grids. (English) Zbl 0552.05040 J. Graph Theory 8, 379-385 (1984). Reviewer: L.Lesniak MSC: 05C45 PDF BibTeX XML Cite \textit{J. L. Brenner} and \textit{R. C. Lyndon}, J. Graph Theory 8, 379--385 (1984; Zbl 0552.05040) Full Text: DOI OpenURL
Eggleton, Roger B.; Skilton, Donald K. Graphs with Eulerian chains. (English) Zbl 0541.05050 Bull. Aust. Math. Soc. 29, 389-399 (1984). Reviewer: L.Lesniak MSC: 05C75 05C45 05C38 PDF BibTeX XML Cite \textit{R. B. Eggleton} and \textit{D. K. Skilton}, Bull. Aust. Math. Soc. 29, 389--399 (1984; Zbl 0541.05050) Full Text: DOI OpenURL
Belyj, S. B. On non-self-intersecting and non-intersecting trails. (Russian) Zbl 0532.05043 Mat. Zametki 34, No. 4, 625-628 (1983). Reviewer: B.Zelinka MSC: 05C45 05C38 PDF BibTeX XML Cite \textit{S. B. Belyj}, Mat. Zametki 34, No. 4, 625--628 (1983; Zbl 0532.05043) OpenURL
Fleischner, Herbert Eulerian graphs. (English) Zbl 0522.05041 Selected topics in graph theory 2, 17-53 (1983). MSC: 05C45 05-02 PDF BibTeX XML OpenURL
Bollobas, Bela; Harary, Frank The trail number of a graph. (English) Zbl 0494.05037 Ann. Discrete Math. 13, 51-60 (1982). MSC: 05C38 05C45 PDF BibTeX XML Cite \textit{B. Bollobas} and \textit{F. Harary}, Ann. Discrete Math. 13, 51--60 (1982; Zbl 0494.05037) Full Text: DOI OpenURL
Suffel, Charles; Tindell, Ralph; Hoffman, Cynthia; Mandell, Manachem Subsemi-Eulerian graphs. (English) Zbl 0486.05040 Int. J. Math. Math. Sci. 5, 553-564 (1982). MSC: 05C35 05C45 05C75 PDF BibTeX XML Cite \textit{C. Suffel} et al., Int. J. Math. Math. Sci. 5, 553--564 (1982; Zbl 0486.05040) Full Text: DOI EuDML OpenURL
Goulden, I. P.; Jackson, D. M. The enumeration of directed closed Euler trails and directed Hamiltonian circuits by Lagrangian methods. (English) Zbl 0465.05050 Eur. J. Comb. 2, 131-135 (1981). MSC: 05C45 05C20 05C30 PDF BibTeX XML Cite \textit{I. P. Goulden} and \textit{D. M. Jackson}, Eur. J. Comb. 2, 131--135 (1981; Zbl 0465.05050) Full Text: DOI OpenURL
Nash-Williams, C. St. J. A. Acyclic detachments of graphs. (English) Zbl 0464.05042 Graph theory and combinatorics, Proc. Conf., The Open Univ./Engl. 1978, Res. Notes Math. 34, 87-97 (1979). MSC: 05C45 PDF BibTeX XML OpenURL