Hu, Jie; Li, Hao; Wang, Yue; Yang, Donglei Graph tilings in incompatibility systems. (English) Zbl 1521.05159 SIAM J. Discrete Math. 37, No. 3, 1930-1951 (2023). Reviewer: Mehrdad Nasernejad (Lens) MSC: 05C70 05C35 PDFBibTeX XMLCite \textit{J. Hu} et al., SIAM J. Discrete Math. 37, No. 3, 1930--1951 (2023; Zbl 1521.05159) Full Text: DOI arXiv
Antoniuk, Sylwia; Kamčev, Nina; Ruciński, Andrzej Properly colored Hamilton cycles in Dirac-type hypergraphs. (English) Zbl 1510.05220 Electron. J. Comb. 30, No. 1, Research Paper P1.44, 31 p. (2023). MSC: 05C65 05C45 05D40 PDFBibTeX XMLCite \textit{S. Antoniuk} et al., Electron. J. Comb. 30, No. 1, Research Paper P1.44, 31 p. (2023; Zbl 1510.05220) Full Text: DOI arXiv
Chen, Xiaozheng; Li, Xueliang Monochromatic-degree conditions for properly colored cycles in edge-colored complete graphs. (English) Zbl 1502.05061 Discrete Math. 346, No. 1, Article ID 113197, 10 p. (2023). MSC: 05C15 05C07 05C38 PDFBibTeX XMLCite \textit{X. Chen} and \textit{X. Li}, Discrete Math. 346, No. 1, Article ID 113197, 10 p. (2023; Zbl 1502.05061) Full Text: DOI
Guo, Shanshan; Huang, Fei; Yuan, Jinjiang Properly colored 2-factors of edge-colored complete bipartite graphs. (English) Zbl 1497.05084 Discrete Math. 345, No. 12, Article ID 113094, 10 p. (2022). MSC: 05C15 PDFBibTeX XMLCite \textit{S. Guo} et al., Discrete Math. 345, No. 12, Article ID 113094, 10 p. (2022; Zbl 1497.05084) Full Text: DOI
Hu, Jie; Li, Hao; Maezawa, Shun-ichi Maximum properly colored trees in edge-colored graphs. (English) Zbl 1498.90240 J. Comb. Optim. 44, No. 1, 154-171 (2022). MSC: 90C35 90C27 05C15 PDFBibTeX XMLCite \textit{J. Hu} et al., J. Comb. Optim. 44, No. 1, 154--171 (2022; Zbl 1498.90240) Full Text: DOI
Beneš, Nikola; Brim, Luboš; Pastva, Samuel; Šafránek, David BDD-based algorithm for SCC decomposition of edge-coloured graphs. (English) Zbl 07566051 Log. Methods Comput. Sci. 18, No. 1, Paper No. 38, 27 p. (2022). MSC: 03B70 68-XX PDFBibTeX XMLCite \textit{N. Beneš} et al., Log. Methods Comput. Sci. 18, No. 1, Paper No. 38, 27 p. (2022; Zbl 07566051) Full Text: arXiv Link
Li, Luyi; Huang, Fei; Yuan, Jinjiang Proper vertex-pancyclicity of edge-colored complete graphs without monochromatic paths of length three. (English) Zbl 1486.05094 Discrete Math. 345, No. 6, Article ID 112838, 9 p. (2022). MSC: 05C15 05C38 05C12 05C35 PDFBibTeX XMLCite \textit{L. Li} et al., Discrete Math. 345, No. 6, Article ID 112838, 9 p. (2022; Zbl 1486.05094) Full Text: DOI
Wu, Fangfang; Zhang, Shenggui; Li, Binlong; Han, Tingting Color neighborhood union conditions for proper edge-pancyclicity of edge-colored complete graphs. (English) Zbl 1481.05056 Discrete Appl. Math. 307, 145-152 (2022). Reviewer: Hong-Jian Lai (Morgantown) MSC: 05C15 05C38 68R10 PDFBibTeX XMLCite \textit{F. Wu} et al., Discrete Appl. Math. 307, 145--152 (2022; Zbl 1481.05056) Full Text: DOI
Beneš, Nikola; Brim, Luboš; Pastva, Samuel; Šafránek, David Symbolic coloured SCC decomposition. (English) Zbl 1474.68210 Groote, Jan Friso (ed.) et al., Tools and algorithms for the construction and analysis of systems. 27th international conference, TACAS 2021, held as part of the European joint conferences on theory and practice of software, ETAPS 2021, Luxembourg City, Luxembourg, March 27 – April 1, 2021. Proceedings. Part II. Cham: Springer. Lect. Notes Comput. Sci. 12652, 64-83 (2021). MSC: 68R10 05C15 05C85 68W30 92C42 PDFBibTeX XMLCite \textit{N. Beneš} et al., Lect. Notes Comput. Sci. 12652, 64--83 (2021; Zbl 1474.68210) Full Text: DOI
Bennett, Patrick; Cushman, Ryan; Dudek, Andrzej On the number of alternating paths in random graphs. (English) Zbl 1473.05280 Discrete Appl. Math. 304, 84-97 (2021). MSC: 05C80 05C40 94B99 94A40 PDFBibTeX XMLCite \textit{P. Bennett} et al., Discrete Appl. Math. 304, 84--97 (2021; Zbl 1473.05280) Full Text: DOI arXiv
Chen, Xiaozheng; Li, Xueliang Proper vertex-pancyclicity of edge-colored complete graphs without joint monochromatic triangles. (English) Zbl 1464.05211 Discrete Appl. Math. 294, 167-180 (2021). MSC: 05C38 05C15 05C45 PDFBibTeX XMLCite \textit{X. Chen} and \textit{X. Li}, Discrete Appl. Math. 294, 167--180 (2021; Zbl 1464.05211) Full Text: DOI arXiv
Guo, Zhiwei; Broersma, Hajo; Li, Binlong; Zhang, Shenggui Almost Eulerian compatible spanning circuits in edge-colored graphs. (English) Zbl 1455.05039 Discrete Math. 344, No. 1, Article ID 112174, 11 p. (2021). MSC: 05C45 05C80 05C15 PDFBibTeX XMLCite \textit{Z. Guo} et al., Discrete Math. 344, No. 1, Article ID 112174, 11 p. (2021; Zbl 1455.05039) Full Text: DOI
Guo, Zhiwei; Broersma, Hajo; Li, Ruonan; Zhang, Shenggui Some algorithmic results for finding compatible spanning circuits in edge-colored graphs. (English) Zbl 1462.05140 J. Comb. Optim. 40, No. 4, 1008-1019 (2020). MSC: 05C15 05C38 05C45 05C85 PDFBibTeX XMLCite \textit{Z. Guo} et al., J. Comb. Optim. 40, No. 4, 1008--1019 (2020; Zbl 1462.05140) Full Text: DOI
Guo, Zhiwei; Li, Binlong; Li, Xueliang; Zhang, Shenggui Compatible spanning circuits in edge-colored graphs. (English) Zbl 1440.05088 Discrete Math. 343, No. 7, Article ID 111908, 12 p. (2020). MSC: 05C15 PDFBibTeX XMLCite \textit{Z. Guo} et al., Discrete Math. 343, No. 7, Article ID 111908, 12 p. (2020; Zbl 1440.05088) Full Text: DOI Link
Chen, Xiaozheng; Huang, Fei; Yuan, Jinjiang Proper vertex-pancyclicity of edge-colored complete graphs without monochromatic triangles. (English) Zbl 1416.05102 Discrete Appl. Math. 265, 199-203 (2019). MSC: 05C15 05C38 PDFBibTeX XMLCite \textit{X. Chen} et al., Discrete Appl. Math. 265, 199--203 (2019; Zbl 1416.05102) Full Text: DOI
Li, Ruonan; Broersma, Hajo; Zhang, Shenggui Properly edge-colored theta graphs in edge-colored complete graphs. (English) Zbl 1407.05097 Graphs Comb. 35, No. 1, 261-286 (2019). MSC: 05C15 05C20 05C38 PDFBibTeX XMLCite \textit{R. Li} et al., Graphs Comb. 35, No. 1, 261--286 (2019; Zbl 1407.05097) Full Text: DOI
Krivelevich, Michael; Lee, Choongbum; Sudakov, Benny Compatible Hamilton cycles in Dirac graphs. (English) Zbl 1399.05143 Combinatorica 37, No. 4, 697-732 (2017). Reviewer: Peter Horák (Tacoma) MSC: 05C45 PDFBibTeX XMLCite \textit{M. Krivelevich} et al., Combinatorica 37, No. 4, 697--732 (2017; Zbl 1399.05143) Full Text: DOI arXiv
Kamčev, Nina; Sudakov, Benny; Volec, Jan Bounded colorings of multipartite graphs and hypergraphs. (English) Zbl 1369.05079 Eur. J. Comb. 66, 235-249 (2017). MSC: 05C15 05C65 05C45 PDFBibTeX XMLCite \textit{N. Kamčev} et al., Eur. J. Comb. 66, 235--249 (2017; Zbl 1369.05079) Full Text: DOI arXiv
Bennett, Patrick; Dudek, Andrzej; Laforge, Elliot On the number of alternating paths in bipartite complete graphs. (English) Zbl 1368.05086 Graphs Comb. 33, No. 2, 307-320 (2017). MSC: 05C40 05D40 90C10 PDFBibTeX XMLCite \textit{P. Bennett} et al., Graphs Comb. 33, No. 2, 307--320 (2017; Zbl 1368.05086) Full Text: DOI arXiv
Sudakov, Benny; Volec, Jan Properly colored and rainbow copies of graphs with few cherries. (English) Zbl 1350.05042 J. Comb. Theory, Ser. B 122, 391-416 (2017). MSC: 05C15 05C55 05D10 PDFBibTeX XMLCite \textit{B. Sudakov} and \textit{J. Volec}, J. Comb. Theory, Ser. B 122, 391--416 (2017; Zbl 1350.05042) Full Text: DOI arXiv
Lo, Allan Properly coloured Hamiltonian cycles in edge-coloured complete graphs. (English) Zbl 1389.05043 Combinatorica 36, No. 4, 471-492 (2016). Reviewer: Bjarne Toft (Odense) MSC: 05C15 05C38 05C45 PDFBibTeX XMLCite \textit{A. Lo}, Combinatorica 36, No. 4, 471--492 (2016; Zbl 1389.05043) Full Text: DOI arXiv Link
Krivelevich, Michael; Lee, Choongbum; Sudakov, Benny Compatible Hamilton cycles in random graphs. (English) Zbl 1349.05199 Random Struct. Algorithms 49, No. 3, 533-557 (2016). MSC: 05C45 05C80 PDFBibTeX XMLCite \textit{M. Krivelevich} et al., Random Struct. Algorithms 49, No. 3, 533--557 (2016; Zbl 1349.05199) Full Text: DOI
Sudakov, Benny; Volec, Jan Properly colored and rainbow copies of graphs with few cherries. (English) Zbl 1346.05184 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, 315-321, electronic only (2015). MSC: 05C55 05D10 05C15 05C60 PDFBibTeX XMLCite \textit{B. Sudakov} and \textit{J. Volec}, Electron. Notes Discrete Math. 49, 315--321 (2015; Zbl 1346.05184) Full Text: DOI arXiv
Dudek, Andrzej; Ferrara, Michael Extensions of results on rainbow Hamilton cycles in uniform hypergraphs. (English) Zbl 1312.05074 Graphs Comb. 31, No. 3, 577-583 (2015). MSC: 05C45 05C38 05C65 05C35 PDFBibTeX XMLCite \textit{A. Dudek} and \textit{M. Ferrara}, Graphs Comb. 31, No. 3, 577--583 (2015; Zbl 1312.05074) Full Text: DOI
Lo, Allan A Dirac type condition for properly coloured paths and cycles. (English) Zbl 1294.05077 J. Graph Theory 76, No. 1, 60-87 (2014). MSC: 05C15 05C38 PDFBibTeX XMLCite \textit{A. Lo}, J. Graph Theory 76, No. 1, 60--87 (2014; Zbl 1294.05077) Full Text: DOI arXiv
Wang, Guanghui; Wang, Tao; Liu, Guizhen Long properly colored cycles in edge colored complete graphs. (English) Zbl 1285.05070 Discrete Math. 324, 56-61 (2014). MSC: 05C15 05C45 05C38 PDFBibTeX XMLCite \textit{G. Wang} et al., Discrete Math. 324, 56--61 (2014; Zbl 1285.05070) Full Text: DOI arXiv
Axenovich, Maria; Krug, Marcus; Osang, Georg; Rutter, Ignaz Fork-forests in bi-colored complete bipartite graphs. (English) Zbl 1287.05039 Discrete Appl. Math. 161, No. 10-11, 1363-1366 (2013). MSC: 05C15 PDFBibTeX XMLCite \textit{M. Axenovich} et al., Discrete Appl. Math. 161, No. 10--11, 1363--1366 (2013; Zbl 1287.05039) Full Text: DOI arXiv
Böttcher, Julia; Kohayakawa, Yoshiharu; Procacci, Aldo Properly coloured copies and rainbow copies of large graphs with small maximum degree. (English) Zbl 1244.05087 Random Struct. Algorithms 40, No. 4, 425-436 (2012). MSC: 05C15 05C07 05D10 PDFBibTeX XMLCite \textit{J. Böttcher} et al., Random Struct. Algorithms 40, No. 4, 425--436 (2012; Zbl 1244.05087) Full Text: DOI arXiv
Abouelaoualim, A.; Das, K. Ch.; de la Vega, W. Fernandez; Karpinski, M.; Manoussakis, Y.; Martinhon, C. A.; Saad, R. Cycles and paths in edge-colored graphs with given degrees. (English) Zbl 1202.05067 J. Graph Theory 64, No. 1, 63-86 (2010). Reviewer: Raphael Yuster (Haifa) MSC: 05C38 05C15 05C07 PDFBibTeX XMLCite \textit{A. Abouelaoualim} et al., J. Graph Theory 64, No. 1, 63--86 (2010; Zbl 1202.05067) Full Text: DOI
Kühn, Daniela; Osthus, Deryk; Treglown, Andrew Hamiltonian degree sequences in digraphs. (English) Zbl 1209.05138 J. Comb. Theory, Ser. B 100, No. 4, 367-380 (2010). Reviewer: Josep M. Brunat (Barcelona) MSC: 05C45 05C07 05C20 PDFBibTeX XMLCite \textit{D. Kühn} et al., J. Comb. Theory, Ser. B 100, No. 4, 367--380 (2010; Zbl 1209.05138) Full Text: DOI arXiv
Kelly, Luke; Kühn, Daniela; Osthus, Deryk Cycles of given length in oriented graphs. (English) Zbl 1274.05257 J. Comb. Theory, Ser. B 100, No. 3, 251-264 (2010). MSC: 05C38 05C20 PDFBibTeX XMLCite \textit{L. Kelly} et al., J. Comb. Theory, Ser. B 100, No. 3, 251--264 (2010; Zbl 1274.05257) Full Text: DOI arXiv
Gutin, Gregory; Jung Kim, Eun Properly coloured cycles and paths: Results and open problems. (English) Zbl 1194.05040 Lipshteyn, Marina (ed.) et al., Graph theory, computational intelligence and thought. Essays dedicated to Martin Charles Golumbic on the occasion of his 60th birthday. Berlin: Springer (ISBN 978-3-642-02028-5/pbk). Lecture Notes in Computer Science 5420, 200-208 (2009). MSC: 05C15 05C38 PDFBibTeX XMLCite \textit{G. Gutin} and \textit{E. Jung Kim}, Lect. Notes Comput. Sci. 5420, 200--208 (2009; Zbl 1194.05040) Full Text: DOI
Wang, Guanghui; Li, Hao Color degree and alternating cycles in edge-colored graphs. (English) Zbl 1198.05070 Discrete Math. 309, No. 13, 4349-4354 (2009). Reviewer: Ulrike Baumann (Dresden) MSC: 05C15 05C38 05C45 PDFBibTeX XMLCite \textit{G. Wang} and \textit{H. Li}, Discrete Math. 309, No. 13, 4349--4354 (2009; Zbl 1198.05070) Full Text: DOI
Kano, Mikio; Li, Xueliang Monochromatic and heterochromatic subgraphs in edge-colored graphs - A survey. (English) Zbl 1190.05045 Graphs Comb. 24, No. 4, 237-263 (2008). MSC: 05C05 05-02 PDFBibTeX XMLCite \textit{M. Kano} and \textit{X. Li}, Graphs Comb. 24, No. 4, 237--263 (2008; Zbl 1190.05045) Full Text: DOI
Bang-Jensen, Jørgen; Gutin, Gregory; Yeo, Anders Properly coloured Hamiltonian paths in edge-coloured complete graphs. (English) Zbl 0897.05037 Discrete Appl. Math. 82, No. 1-3, 247-250 (1998). Reviewer: T.R.Walsh (Montreal) MSC: 05C15 05C45 PDFBibTeX XMLCite \textit{J. Bang-Jensen} et al., Discrete Appl. Math. 82, No. 1--3, 247--250 (1998; Zbl 0897.05037) Full Text: DOI Link
Bang-Jensen, Jørgen; Gutin, Gregory Alternating cycles and paths in edge-coloured multigraphs: A survey. (English) Zbl 0876.05057 Discrete Math. 165-166, 39-60 (1997). Reviewer: A.Huck (Hannover) MSC: 05C38 05C15 05-02 05C45 PDFBibTeX XMLCite \textit{J. Bang-Jensen} and \textit{G. Gutin}, Discrete Math. 165--166, 39--60 (1997; Zbl 0876.05057) Full Text: DOI