Ma, Zhiqiang; Mao, Yaping; Schiermeyer, Ingo; Wei, Meiqin Complete bipartite graphs without small rainbow subgraphs. (English) Zbl 07804731 Discrete Appl. Math. 346, 248-262 (2024). MSC: 05C55 05D10 05C15 PDFBibTeX XMLCite \textit{Z. Ma} et al., Discrete Appl. Math. 346, 248--262 (2024; Zbl 07804731) Full Text: DOI
Guo, Zhiwei; Brause, Christoph; Geißer, Maximilian; Schiermeyer, Ingo Compatible spanning circuits and forbidden induced subgraphs. (English) Zbl 07796531 Graphs Comb. 40, No. 1, Paper No. 15, 14 p. (2024). MSC: 05C15 05C38 05C45 05C60 05C35 PDFBibTeX XMLCite \textit{Z. Guo} et al., Graphs Comb. 40, No. 1, Paper No. 15, 14 p. (2024; Zbl 07796531) Full Text: DOI OA License
Brause, Christoph; Jendrol’, Stanislav; Schiermeyer, Ingo Loose edge-connection of graphs. (English) Zbl 1519.05138 Graphs Comb. 39, No. 4, Paper No. 79, 18 p. (2023). MSC: 05C40 05C15 05C35 68Q17 PDFBibTeX XMLCite \textit{C. Brause} et al., Graphs Comb. 39, No. 4, Paper No. 79, 18 p. (2023; Zbl 1519.05138) Full Text: DOI arXiv
Mao, Yaping; Wang, Zhao; Magnant, Colton; Schiermeyer, Ingo Gallai-Ramsey numbers for fans. (English) Zbl 1509.05129 Discrete Math. 346, No. 5, Article ID 113338, 15 p. (2023). MSC: 05C55 05D10 05C15 05C35 PDFBibTeX XMLCite \textit{Y. Mao} et al., Discrete Math. 346, No. 5, Article ID 113338, 15 p. (2023; Zbl 1509.05129) Full Text: DOI arXiv
Doan, Trung Duy; Ha, Pham Hoang; Schiermeyer, Ingo The conflict-free vertex-connection number and degree conditions of graphs. (English) Zbl 1497.05078 Graphs Comb. 38, No. 5, Paper No. 157, 16 p. (2022). MSC: 05C15 05C38 05C40 05C07 05C35 PDFBibTeX XMLCite \textit{T. D. Doan} et al., Graphs Comb. 38, No. 5, Paper No. 157, 16 p. (2022; Zbl 1497.05078) Full Text: DOI
Mao, Ya Ping; Wang, Zhao; Magnant, Colton; Schiermeyer, Ingo Gallai-Ramsey number for the union of stars. (English) Zbl 1498.05181 Acta Math. Sin., Engl. Ser. 38, No. 8, 1317-1332 (2022). MSC: 05C55 05D10 05C15 PDFBibTeX XMLCite \textit{Y. P. Mao} et al., Acta Math. Sin., Engl. Ser. 38, No. 8, 1317--1332 (2022; Zbl 1498.05181) Full Text: DOI arXiv
Trung Duy Doan; Schiermeyer, Ingo The proper 2-connection number and size of graphs. (English) Zbl 1520.05033 Discrete Appl. Math. 320, 296-303 (2022). MSC: 05C12 05C15 05C40 PDFBibTeX XMLCite \textit{Trung Duy Doan} and \textit{I. Schiermeyer}, Discrete Appl. Math. 320, 296--303 (2022; Zbl 1520.05033) Full Text: DOI
Brause, Christoph; Geißer, Maximilian; Schiermeyer, Ingo Homogeneous sets, clique-separators, critical graphs, and optimal \(\chi\)-binding functions. (English) Zbl 1495.05085 Discrete Appl. Math. 320, 211-222 (2022). MSC: 05C15 05C75 PDFBibTeX XMLCite \textit{C. Brause} et al., Discrete Appl. Math. 320, 211--222 (2022; Zbl 1495.05085) Full Text: DOI arXiv
Mao, Yaping; Wang, Zhao; Magnant, Colton; Schiermeyer, Ingo Ramsey and Gallai-Ramsey number for wheels. (English) Zbl 1485.05110 Graphs Comb. 38, No. 2, Paper No. 42, 17 p. (2022). Reviewer: Ioan Tomescu (Bucureşti) MSC: 05C55 05C15 05C35 05C38 05C70 PDFBibTeX XMLCite \textit{Y. Mao} et al., Graphs Comb. 38, No. 2, Paper No. 42, 17 p. (2022; Zbl 1485.05110) Full Text: DOI arXiv
Doan, Trung Duy; Schiermeyer, Ingo Conflict-free connection number and size of graphs. (English) Zbl 1482.05101 Graphs Comb. 37, No. 5, 1859-1871 (2021). Reviewer: Josef Lauri (Msida) MSC: 05C15 05C40 PDFBibTeX XMLCite \textit{T. D. Doan} and \textit{I. Schiermeyer}, Graphs Comb. 37, No. 5, 1859--1871 (2021; Zbl 1482.05101) Full Text: DOI
Brause, Christoph; Jendrol’, Stanislav; Schiermeyer, Ingo From colourful to rainbow paths in graphs: colouring the vertices. (English) Zbl 1482.05097 Graphs Comb. 37, No. 5, 1823-1839 (2021). MSC: 05C15 05C38 PDFBibTeX XMLCite \textit{C. Brause} et al., Graphs Comb. 37, No. 5, 1823--1839 (2021; Zbl 1482.05097) Full Text: DOI
Doan, Trung Duy; Schiermeyer, Ingo Proper rainbow connection number of graphs. (English) Zbl 1459.05077 Discuss. Math., Graph Theory 41, No. 3, 809-826 (2021). MSC: 05C15 05C40 05C07 PDFBibTeX XMLCite \textit{T. D. Doan} and \textit{I. Schiermeyer}, Discuss. Math., Graph Theory 41, No. 3, 809--826 (2021; Zbl 1459.05077) Full Text: DOI arXiv
Doan, Trung Duy; Schiermeyer, Ingo Conflict-free vertex connection number at most 3 and size of graphs. (English) Zbl 1458.05062 Discuss. Math., Graph Theory 41, No. 2, 617-632 (2021). MSC: 05C15 05C40 05C07 05C12 PDFBibTeX XMLCite \textit{T. D. Doan} and \textit{I. Schiermeyer}, Discuss. Math., Graph Theory 41, No. 2, 617--632 (2021; Zbl 1458.05062) Full Text: DOI
Ji, Meng; Mao, Yaping; Schiermeyer, Ingo Asymptotic Bounds for CO-irredundant and Irredundant Ramsey Numbers. arXiv:2109.07718 Preprint, arXiv:2109.07718 [math.CO] (2021). MSC: 05C55 05C15 05C30 05D40 BibTeX Cite \textit{M. Ji} et al., ``Asymptotic Bounds for CO-irredundant and Irredundant Ramsey Numbers'', Preprint, arXiv:2109.07718 [math.CO] (2021) Full Text: arXiv OA License
Liu, Henry; Magnant, Colton; Saito, Akira; Schiermeyer, Ingo; Shi, Yongtang Gallai-Ramsey number for \(K_4\). (English) Zbl 1495.05100 J. Graph Theory 94, No. 2, 192-205 (2020). MSC: 05C15 05C55 05D10 PDFBibTeX XMLCite \textit{H. Liu} et al., J. Graph Theory 94, No. 2, 192--205 (2020; Zbl 1495.05100) Full Text: DOI
Brause, Christoph; Holub, Přemysl; Kabela, Adam; Ryjáček, Zdeněk; Schiermeyer, Ingo; Vrána, Petr On forbidden induced subgraphs for \(K_{1, 3}\)-free perfect graphs. (English) Zbl 1414.05127 Discrete Math. 342, No. 6, 1602-1608 (2019). MSC: 05C17 05C15 05C40 PDFBibTeX XMLCite \textit{C. Brause} et al., Discrete Math. 342, No. 6, 1602--1608 (2019; Zbl 1414.05127) Full Text: DOI arXiv
Schiermeyer, Ingo; Randerath, Bert Polynomial \(\chi \)-binding functions and forbidden induced subgraphs: a survey. (English) Zbl 1407.05099 Graphs Comb. 35, No. 1, 1-31 (2019). MSC: 05C17 05C15 PDFBibTeX XMLCite \textit{I. Schiermeyer} and \textit{B. Randerath}, Graphs Comb. 35, No. 1, 1--31 (2019; Zbl 1407.05099) Full Text: DOI
Brause, Christoph; Randerath, Bert; Schiermeyer, Ingo; Vumar, Elkin On the chromatic number of \(2 K_2\)-free graphs. (English) Zbl 1401.05105 Discrete Appl. Math. 253, 14-24 (2019). MSC: 05C15 PDFBibTeX XMLCite \textit{C. Brause} et al., Discrete Appl. Math. 253, 14--24 (2019; Zbl 1401.05105) Full Text: DOI
Chang, Hong; Doan, Trung Duy; Huang, Zhong; Jendrol’, Stanislav; Li, Xueliang; Schiermeyer, Ingo Graphs with conflict-free connection number two. (English) Zbl 1402.05060 Graphs Comb. 34, No. 6, 1553-1563 (2018). MSC: 05C15 05C40 05C07 PDFBibTeX XMLCite \textit{H. Chang} et al., Graphs Comb. 34, No. 6, 1553--1563 (2018; Zbl 1402.05060) Full Text: DOI arXiv
Brause, Christoph; Jendrol’, Stanislav; Schiermeyer, Ingo Odd connection and odd vertex-connection of graphs. (English) Zbl 1397.05060 Discrete Math. 341, No. 12, 3500-3512 (2018). MSC: 05C15 05C40 05C05 PDFBibTeX XMLCite \textit{C. Brause} et al., Discrete Math. 341, No. 12, 3500--3512 (2018; Zbl 1397.05060) Full Text: DOI
Schiermeyer, Ingo On the chromatic number of \((P_{5},\mathrm{windmill})\)-free graphs. (English) Zbl 1420.05061 Opusc. Math. 37, No. 4, 609-615 (2017). Reviewer: Steve Noble (London) MSC: 05C15 05C17 PDFBibTeX XMLCite \textit{I. Schiermeyer}, Opusc. Math. 37, No. 4, 609--615 (2017; Zbl 1420.05061) Full Text: DOI
Brause, Christoph; Doan, Trung Duy; Schiermeyer, Ingo Minimum degree conditions for the proper connection number of graphs. (English) Zbl 1371.05153 Graphs Comb. 33, No. 4, 833-843 (2017). MSC: 05C40 05C35 05C07 05C15 PDFBibTeX XMLCite \textit{C. Brause} et al., Graphs Comb. 33, No. 4, 833--843 (2017; Zbl 1371.05153) Full Text: DOI
van Aardt, Susan A.; Brause, Christoph; Burger, Alewyn P.; Frick, Marietjie; Kemnitz, Arnfried; Schiermeyer, Ingo Proper connection and size of graphs. (English) Zbl 1369.05088 Discrete Math. 340, No. 11, 2673-2677 (2017). MSC: 05C15 05C12 05C40 PDFBibTeX XMLCite \textit{S. A. van Aardt} et al., Discrete Math. 340, No. 11, 2673--2677 (2017; Zbl 1369.05088) Full Text: DOI
Kemnitz, Arnfried; Krause, Philipp; Schiermeyer, Ingo Rainbow connection number two and clique number. (English) Zbl 1360.05062 Congr. Numerantium 226, 155-163 (2016). MSC: 05C15 05C40 05C69 PDFBibTeX XMLCite \textit{A. Kemnitz} et al., Congr. Numerantium 226, 155--163 (2016; Zbl 1360.05062)
Brause, Christoph; Doan, Trung Duy; Schiermeyer, Ingo On the chromatic number of \((P_{5},K_{2,t})\)-free graphs. (English) Zbl 1356.05046 Ceselli, Alberto (ed.) et al., Extended abstracts of the 14th Cologne-Twente workshop on graphs and combinatorial optimization (CTW’16), Gargnano, Italy, June 6–8, 2016. Amsterdam: Elsevier. Electronic Notes in Discrete Mathematics 55, 127-130 (2016). MSC: 05C15 05C31 PDFBibTeX XMLCite \textit{C. Brause} et al., Electron. Notes Discrete Math. 55, 127--130 (2016; Zbl 1356.05046) Full Text: DOI
Kemnitz, Arnfried; Schiermeyer, Ingo Sufficient conditions for 2-rainbow connected graphs. (English) Zbl 1339.05139 Discrete Appl. Math. 209, 247-250 (2016). MSC: 05C15 05C40 PDFBibTeX XMLCite \textit{A. Kemnitz} and \textit{I. Schiermeyer}, Discrete Appl. Math. 209, 247--250 (2016; Zbl 1339.05139) Full Text: DOI
Brause, C.; Randerath, B.; Rautenbach, D.; Schiermeyer, I. A lower bound on the independence number of a graph in terms of degrees and local clique sizes. (English) Zbl 1339.05279 Discrete Appl. Math. 209, 59-67 (2016). MSC: 05C69 05C15 05C07 PDFBibTeX XMLCite \textit{C. Brause} et al., Discrete Appl. Math. 209, 59--67 (2016; Zbl 1339.05279) Full Text: DOI
Schiermeyer, Ingo Chromatic number of \(P_5\)-free graphs: Reed’s conjecture. (English) Zbl 1334.05045 Discrete Math. 339, No. 7, 1940-1943 (2016). MSC: 05C15 PDFBibTeX XMLCite \textit{I. Schiermeyer}, Discrete Math. 339, No. 7, 1940--1943 (2016; Zbl 1334.05045) Full Text: DOI
Holub, Přemysl; Ryjáček, Zdeněk; Schiermeyer, Ingo; Vrána, Petr Characterizing forbidden pairs for rainbow connection in graphs with minimum degree 2. (English) Zbl 1327.05182 Discrete Math. 339, No. 2, 1058-1068 (2016). MSC: 05C40 05C15 05C60 PDFBibTeX XMLCite \textit{P. Holub} et al., Discrete Math. 339, No. 2, 1058--1068 (2016; Zbl 1327.05182) Full Text: DOI
Brause, Christoph; Schiermeyer, Ingo; Holub, Přemysl; Ryjáček, Zdeněk; Vrána, Petr; Krivoš-Belluš, Rastislav 4-colorability of \(P_6\)-free graphs. (English) Zbl 1346.05060 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, 37-42, electronic only (2015). MSC: 05C15 68Q17 PDFBibTeX XMLCite \textit{C. Brause} et al., Electron. Notes Discrete Math. 49, 37--42 (2015; Zbl 1346.05060) Full Text: DOI
Holub, Přemysl; Ryjáček, Zdeněk; Schiermeyer, Ingo; Vrána, Petr Rainbow connection and forbidden subgraphs. (English) Zbl 1315.05053 Discrete Math. 338, No. 10, 1706-1713 (2015). MSC: 05C15 05C60 05C35 PDFBibTeX XMLCite \textit{P. Holub} et al., Discrete Math. 338, No. 10, 1706--1713 (2015; Zbl 1315.05053) Full Text: DOI
Li, Xueliang; Schiermeyer, Ingo; Yang, Kang; Zhao, Yan Graphs with 4-rainbow index 3 and \(n-1\). (English) Zbl 1311.05032 Discuss. Math., Graph Theory 35, No. 2, 387-398 (2015). MSC: 05C05 05C15 05C75 PDFBibTeX XMLCite \textit{X. Li} et al., Discuss. Math., Graph Theory 35, No. 2, 387--398 (2015; Zbl 1311.05032) Full Text: DOI arXiv
Horňák, Mirko; Jendrol’, Stanislav; Schiermeyer, Ingo; Soták, Roman Rainbow numbers for cycles in plane triangulations. (English) Zbl 1309.05107 J. Graph Theory 78, No. 4, 248-257 (2015). MSC: 05C38 05C15 PDFBibTeX XMLCite \textit{M. Horňák} et al., J. Graph Theory 78, No. 4, 248--257 (2015; Zbl 1309.05107) Full Text: DOI
Li, Xueliang; Schiermeyer, Ingo; Yang, Kang; Zhao, Yan Graphs with 3-rainbow index \(n-1\) and \(n-2\). (English) Zbl 1307.05051 Discuss. Math., Graph Theory 35, No. 1, 105-120 (2015). MSC: 05C05 05C15 05C75 PDFBibTeX XMLCite \textit{X. Li} et al., Discuss. Math., Graph Theory 35, No. 1, 105--120 (2015; Zbl 1307.05051) Full Text: DOI arXiv
Holub, Přemysl; Ryjáček, Zdeněk; Schiermeyer, Ingo On forbidden subgraphs and rainbow connection in graphs with minimum degree 2. (English) Zbl 1305.05150 Discrete Math. 338, No. 3, 1-8 (2015). MSC: 05C60 05C35 05C07 05C15 05C40 PDFBibTeX XMLCite \textit{P. Holub} et al., Discrete Math. 338, No. 3, 1--8 (2015; Zbl 1305.05150) Full Text: DOI
Dorbec, Paul; Schiermeyer, Ingo; Sidorowicz, Elżbieta; Sopena, Éric Rainbow connection in oriented graphs. (English) Zbl 1303.05099 Discrete Appl. Math. 179, 69-78 (2014). MSC: 05C40 05C15 05C38 05C20 PDFBibTeX XMLCite \textit{P. Dorbec} et al., Discrete Appl. Math. 179, 69--78 (2014; Zbl 1303.05099) Full Text: DOI
Jendrol’, Stanislav; Schiermeyer, Ingo; Tu, Jianhua Rainbow numbers for matchings in plane triangulations. (English) Zbl 1297.05191 Discrete Math. 331, 158-164 (2014). MSC: 05C70 05C15 05C10 PDFBibTeX XMLCite \textit{S. Jendrol'} et al., Discrete Math. 331, 158--164 (2014; Zbl 1297.05191) Full Text: DOI
Schiermeyer, Ingo On the minimum rainbow subgraph number of a graph. (English) Zbl 1301.05136 Ars Math. Contemp. 6, No. 1, 83-88 (2013). MSC: 05C15 05C35 PDFBibTeX XMLCite \textit{I. Schiermeyer}, Ars Math. Contemp. 6, No. 1, 83--88 (2013; Zbl 1301.05136) Full Text: DOI
Schiermeyer, Ingo Rainbow connection and minimum degree. (English) Zbl 1287.05047 Discrete Appl. Math. 161, No. 12, 1784-1787 (2013). MSC: 05C15 05C40 PDFBibTeX XMLCite \textit{I. Schiermeyer}, Discrete Appl. Math. 161, No. 12, 1784--1787 (2013; Zbl 1287.05047) Full Text: DOI
Bode, Jens-P.; Kemnitz, Arnfried; Schiermeyer, Ingo Grundy numbers of products of paths, cycles, and stars. (English) Zbl 1293.05098 Congr. Numerantium 216, 65-72 (2013). MSC: 05C15 05C78 05C76 PDFBibTeX XMLCite \textit{J.-P. Bode} et al., Congr. Numerantium 216, 65--72 (2013; Zbl 1293.05098)
Kemnitz, Arnfried; Przybyło, Jakub; Schiermeyer, Ingo; Woźniak, Mariusz Rainbow connection in sparse graphs. (English) Zbl 1291.05069 Discuss. Math., Graph Theory 33, No. 1, 181-192 (2013). MSC: 05C15 PDFBibTeX XMLCite \textit{A. Kemnitz} et al., Discuss. Math., Graph Theory 33, No. 1, 181--192 (2013; Zbl 1291.05069) Full Text: DOI
Ekstein, Jan; Holub, Přemysl; Kaiser, Tomáš; Koch, Maria; Camacho, Stephan Matos; Ryjáček, Zdeněk; Schiermeyer, Ingo The rainbow connection number of 2-connected graphs. (English) Zbl 1277.05061 Discrete Math. 313, No. 19, 1884-1892 (2013). MSC: 05C15 05C40 PDFBibTeX XMLCite \textit{J. Ekstein} et al., Discrete Math. 313, No. 19, 1884--1892 (2013; Zbl 1277.05061) Full Text: DOI arXiv
Li, Xueliang; Liu, Mengmeng; Schiermeyer, Ingo Rainbow connection number of dense graphs. (English) Zbl 1275.05022 Discuss. Math., Graph Theory 33, No. 3, 603-611 (2013). MSC: 05C15 05C40 PDFBibTeX XMLCite \textit{X. Li} et al., Discuss. Math., Graph Theory 33, No. 3, 603--611 (2013; Zbl 1275.05022) Full Text: DOI arXiv
Schiermeyer, Ingo On minimally rainbow \(k\)-connected graphs. (English) Zbl 1259.05102 Discrete Appl. Math. 161, No. 4-5, 702-705 (2013). MSC: 05C40 05C15 05C35 PDFBibTeX XMLCite \textit{I. Schiermeyer}, Discrete Appl. Math. 161, No. 4--5, 702--705 (2013; Zbl 1259.05102) Full Text: DOI
Schiermeyer, Ingo; Sotak, Roman Rainbow numbers for graphs with cyclomatic number at most two. arXiv:1210.6924 Preprint, arXiv:1210.6924 [math.CO] (2012). MSC: 05C15 05C35 BibTeX Cite \textit{I. Schiermeyer} and \textit{R. Sotak}, ``Rainbow numbers for graphs with cyclomatic number at most two'', Preprint, arXiv:1210.6924 [math.CO] (2012) Full Text: arXiv OA License
Koch, Maria; Camacho, Stephan Matos; Schiermeyer, Ingo Algorithmic approaches for the minimum rainbow subgraph problem. (English) Zbl 1274.05167 Nešetřil, Jarik (ed.) et al., Extended abstracts of the sixth European conference on combinatorics, graph theory and applications, EuroComb 2011, Budapest, Hungary, August 29 – September 2, 2011. Amsterdam: Elsevier. Electronic Notes in Discrete Mathematics 38, 765-770 (2011). MSC: 05C15 05C85 68Q17 68W25 PDFBibTeX XMLCite \textit{M. Koch} et al., Electron. Notes Discrete Math. 38, 765--770 (2011; Zbl 1274.05167) Full Text: Link
Katrenič, Ján; Schiermeyer, Ingo Improved approximation bounds for the minimum rainbow subgraph problem. (English) Zbl 1259.05167 Inf. Process. Lett. 111, No. 3, 110-114 (2011). MSC: 05C85 05C15 68Q17 68W40 PDFBibTeX XMLCite \textit{J. Katrenič} and \textit{I. Schiermeyer}, Inf. Process. Lett. 111, No. 3, 110--114 (2011; Zbl 1259.05167) Full Text: DOI
Schiermeyer, Ingo Bounds for the rainbow connection number of graphs. (English) Zbl 1234.05132 Discuss. Math., Graph Theory 31, No. 2, 387-395 (2011). MSC: 05C35 05C40 05C15 PDFBibTeX XMLCite \textit{I. Schiermeyer}, Discuss. Math., Graph Theory 31, No. 2, 387--395 (2011; Zbl 1234.05132) Full Text: DOI
Kemnitz, Arnfried; Schiermeyer, Ingo Graphs with rainbow connection number two. (English) Zbl 1234.05092 Discuss. Math., Graph Theory 31, No. 2, 313-320 (2011). MSC: 05C15 05C35 PDFBibTeX XMLCite \textit{A. Kemnitz} and \textit{I. Schiermeyer}, Discuss. Math., Graph Theory 31, No. 2, 313--320 (2011; Zbl 1234.05092) Full Text: DOI Link
Löwenstein, Christian; Rautenbach, Dieter; Schiermeyer, Ingo Cycle length parities and the chromatic number. (English) Zbl 1209.05091 J. Graph Theory 64, No. 3, 210-218 (2010). MSC: 05C15 05C38 PDFBibTeX XMLCite \textit{C. Löwenstein} et al., J. Graph Theory 64, No. 3, 210--218 (2010; Zbl 1209.05091) Full Text: DOI Link
Kohl, Anja; Schiermeyer, Ingo Some results on Reed’s conjecture about \(\omega ,\Delta \), and \(\chi \) with respect to \(\alpha \). (English) Zbl 1221.05147 Discrete Math. 310, No. 9, 1429-1438 (2010). MSC: 05C15 05C69 PDFBibTeX XMLCite \textit{A. Kohl} and \textit{I. Schiermeyer}, Discrete Math. 310, No. 9, 1429--1438 (2010; Zbl 1221.05147) Full Text: DOI
Camacho, Stephan Matos; Schiermeyer, Ingo Colourings of graphs with two consecutive odd cycle lengths. (English) Zbl 1213.05069 Discrete Math. 309, No. 15, 4916-4919 (2009). MSC: 05C15 05C38 PDFBibTeX XMLCite \textit{S. M. Camacho} and \textit{I. Schiermeyer}, Discrete Math. 309, No. 15, 4916--4919 (2009; Zbl 1213.05069) Full Text: DOI
Schiermeyer, Ingo Rainbow connection in graphs with minimum degree three. (English) Zbl 1267.05125 Fiala, Jiří (ed.) et al., Combinatorial algorithms. 20th international workshop, IWOCA 2009, Hradec nad Moravicí, Czech Republic, June 28–July 2, 2009. Revised selected papers. Berlin: Springer (ISBN 978-3-642-10216-5/pbk). Lecture Notes in Computer Science 5874, 432-437 (2009). MSC: 05C15 05C40 PDFBibTeX XMLCite \textit{I. Schiermeyer}, Lect. Notes Comput. Sci. 5874, 432--437 (2009; Zbl 1267.05125) Full Text: DOI
Fujita, Shinya; Kaneko, Atsushi; Schiermeyer, Ingo; Suzuki, Kazuhiro A rainbow \(k\)-matching in the complete graph with \(r\) colors. (English) Zbl 1181.05040 Electron. J. Comb. 16, No. 1, Research Paper R51, 13 p. (2009). MSC: 05C15 PDFBibTeX XMLCite \textit{S. Fujita} et al., Electron. J. Comb. 16, No. 1, Research Paper R51, 13 p. (2009; Zbl 1181.05040) Full Text: EuDML EMIS
Schiermeyer, Ingo Algorithmic bounds for the chromatic number. (English) Zbl 1133.05033 Optimization 57, No. 1, 153-158 (2008). MSC: 05C15 05C85 PDFBibTeX XMLCite \textit{I. Schiermeyer}, Optimization 57, No. 1, 153--158 (2008; Zbl 1133.05033) Full Text: DOI
Salvador Villà, Marta; Schiermeyer, Ingo \([r,s,t]\)-colourings of paths. (English) Zbl 1146.05026 Opusc. Math. 27, No. 1, 131-149 (2007). MSC: 05C15 05C38 PDFBibTeX XMLCite \textit{M. Salvador Villà} and \textit{I. Schiermeyer}, Opusc. Math. 27, No. 1, 131--149 (2007; Zbl 1146.05026)
Schiermeyer, Ingo A new upper bound for the chromatic number of a graph. (English) Zbl 1137.05035 Discuss. Math., Graph Theory 27, No. 1, 137-142 (2007). Reviewer: V. Lokesha (Bangalore) MSC: 05C15 05C69 PDFBibTeX XMLCite \textit{I. Schiermeyer}, Discuss. Math., Graph Theory 27, No. 1, 137--142 (2007; Zbl 1137.05035) Full Text: DOI Link
Le, Van Bang; Randerath, Bert; Schiermeyer, Ingo On the complexity of 4-coloring graphs without long induced paths. (English) Zbl 1143.68060 Theor. Comput. Sci. 389, No. 1-2, 330-335 (2007). MSC: 68R10 05C15 05C85 68Q17 PDFBibTeX XMLCite \textit{V. B. Le} et al., Theor. Comput. Sci. 389, No. 1--2, 330--335 (2007; Zbl 1143.68060) Full Text: DOI
Axenovich, Maria; Harborth, Heiko; Kemnitz, Arnfried; Möller, Meinhard; Schiermeyer, Ingo Rainbows in the hypercube. (English) Zbl 1118.05028 Graphs Comb. 23, No. 2, 123-133 (2007). Reviewer: Martin Knor (Bratislava) MSC: 05C15 PDFBibTeX XMLCite \textit{M. Axenovich} et al., Graphs Comb. 23, No. 2, 123--133 (2007; Zbl 1118.05028) Full Text: DOI
Randerath, Bert; Schiermeyer, Ingo On Reed’s conjecture about \(\omega\), \(\Delta\) and \(\chi\). (English) Zbl 1115.05038 Bondy, Adrian (ed.) et al., Graph theory in Paris. Proceedings of a conference, GT04, in memory of Claude Berge, Paris, France, July 2004. Basel: Birkhäuser (ISBN 3-7643-7228-1/hbk). Trends in Mathematics, 339-346 (2007). Reviewer: Mirko Lepović (Kragujevac) MSC: 05C15 PDFBibTeX XMLCite \textit{B. Randerath} and \textit{I. Schiermeyer}, in: Graph theory in Paris. Proceedings of a conference, GT04, in memory of Claude Berge, Paris, France, July 2004. Basel: Birkhäuser. 339--346 (2007; Zbl 1115.05038)
Schiermeyer, Ingo Upper bounds for the chromatic number of a graph. (English) Zbl 1134.05315 Faigle, U. (ed.) et al., CTW2006. Cologne-Twente Workshop on graphs and combinatorial optimization, Lambrecht, Germany, June 5–9, 2006. Amsterdam: Elsevier. Electronic Notes in Discrete Mathematics 25, 147-148 (2006). MSC: 05C15 PDFBibTeX XMLCite \textit{I. Schiermeyer}, Electron. Notes Discrete Math. 25, 147--148 (2006; Zbl 1134.05315) Full Text: DOI
Randerath, Bert; Schiermeyer, Ingo Vertex colouring and forbidden subgraphs – a survey. (English) Zbl 1056.05065 Graphs Comb. 20, No. 1, 1-40 (2004). Reviewer: Carsten Thomassen (Lyngby) MSC: 05C15 PDFBibTeX XMLCite \textit{B. Randerath} and \textit{I. Schiermeyer}, Graphs Comb. 20, No. 1, 1--40 (2004; Zbl 1056.05065) Full Text: DOI Link
Schiermeyer, Ingo Rainbow numbers for matchings and complete graphs. (English) Zbl 1053.05053 Discrete Math. 286, No. 1-2, 157-162 (2004). Reviewer: Gabriel Semanišin (Košice) MSC: 05C15 05C35 05C55 PDFBibTeX XMLCite \textit{I. Schiermeyer}, Discrete Math. 286, No. 1--2, 157--162 (2004; Zbl 1053.05053) Full Text: DOI
Mihók, P.; Schiermeyer, I. Cycle lengths and chromatic number of graphs. (English) Zbl 1055.05060 Discrete Math. 286, No. 1-2, 147-149 (2004). Reviewer: Peter Horák (Tacoma) MSC: 05C15 05C38 PDFBibTeX XMLCite \textit{P. Mihók} and \textit{I. Schiermeyer}, Discrete Math. 286, No. 1--2, 147--149 (2004; Zbl 1055.05060) Full Text: DOI
Randerath, Bert; Schiermeyer, Ingo 3-colorability \(\in \mathcal P\) for \(P_{6}\)-free graphs. (English) Zbl 1035.05042 Discrete Appl. Math. 136, No. 2-3, 299-313 (2004). MSC: 05C15 05C17 05C85 PDFBibTeX XMLCite \textit{B. Randerath} and \textit{I. Schiermeyer}, Discrete Appl. Math. 136, No. 2--3, 299--313 (2004; Zbl 1035.05042) Full Text: DOI
Randerath, Bert; Schiermeyer, Ingo A note on Brooks’ theorem for triangle-free graphs. (English) Zbl 1018.05036 Australas. J. Comb. 26, 3-9 (2002). Reviewer: Saul Stahl (Lawrence) MSC: 05C15 PDFBibTeX XMLCite \textit{B. Randerath} and \textit{I. Schiermeyer}, Australas. J. Comb. 26, 3--9 (2002; Zbl 1018.05036)
Randerath, Bert; Schiermeyer, Ingo; Tewes, Meike Three-colourability and forbidden subgraphs. II: Polynomial algorithms. (English) Zbl 0999.05042 Discrete Math. 251, No. 1-3, 137-153 (2002). MSC: 05C15 05C85 05C75 PDFBibTeX XMLCite \textit{B. Randerath} et al., Discrete Math. 251, No. 1--3, 137--153 (2002; Zbl 0999.05042) Full Text: DOI
Randerath, Bert; Schiermeyer, Ingo Chromatic number of graphs each path of which is 3-colourable. (English) Zbl 1007.05051 Result. Math. 41, No. 1-2, 150-155 (2002). Reviewer: Van Bang Le (Rostock) MSC: 05C15 05C75 PDFBibTeX XMLCite \textit{B. Randerath} and \textit{I. Schiermeyer}, Result. Math. 41, No. 1--2, 150--155 (2002; Zbl 1007.05051) Full Text: DOI
Randerath, Bert; Schiermeyer, Ingo 3-colorability \(\in\mathrm{P}\) for \(P_{6}\)-free graphs. (English) Zbl 1409.05090 Broersma, Hajo (ed.) et al., Proceedings of the 1st Cologne Twente workshop on graphs and combinatorial optimization, Cologne, Germany, June 6–8, 2001. Extended abstracts. Amsterdam: Elsevier. Electron. Notes Discrete Math. 8, 85-89 (2001). MSC: 05C15 05C85 05C17 68Q25 PDFBibTeX XMLCite \textit{B. Randerath} and \textit{I. Schiermeyer}, Electron. Notes Discrete Math. 8, 85--89 (2001; Zbl 1409.05090) Full Text: Link
Randerath, Bert; Schiemeyer, Ingo Colouring graphs with prescribed induced cycle lengths. (English) Zbl 1002.05026 Discuss. Math., Graph Theory 21, No. 2, 267-281 (2001). MSC: 05C15 05C75 05C85 PDFBibTeX XMLCite \textit{B. Randerath} and \textit{I. Schiemeyer}, Discuss. Math., Graph Theory 21, No. 2, 267--281 (2001; Zbl 1002.05026) Full Text: DOI
Schiermeyer, I.; Tuza, Zsolt; Voigt, Margit On-line rankings of graphs. (English) Zbl 0946.05039 Discrete Math. 212, No. 1-2, 141-147 (2000). Reviewer: H.-J.Presia (Ilmenau) MSC: 05C15 05C75 PDFBibTeX XMLCite \textit{I. Schiermeyer} et al., Discrete Math. 212, No. 1--2, 141--147 (2000; Zbl 0946.05039) Full Text: DOI
Schiermeyer, Ingo; Randerath, Bert Colouring graphs with prescribed induced cycle lengths. (English) Zbl 0924.05029 Proceedings of the 10th annual ACM-SIAM symposium on discrete algorithms. Baltimore, MD, USA, January 17–19, 1999. Philadelphia, PA: SIAM. S 965-S 967 (1999). MSC: 05C15 PDFBibTeX XMLCite \textit{I. Schiermeyer} and \textit{B. Randerath}, in: Proceedings of the 10th annual ACM-SIAM symposium on discrete algorithms, SODA '99. Baltimore, MD, USA, January 17--19, 1999. Philadelphia, PA: SIAM. 965--967 (1999; Zbl 0924.05029)
Schiermeyer, Ingo Fast exact colouring algorithms. (English) Zbl 0855.05065 Tatra Mt. Math. Publ. 9, 15-30 (1996). Reviewer: A.Kapralski (Fukushima) MSC: 05C15 05C85 68R10 PDFBibTeX XMLCite \textit{I. Schiermeyer}, Tatra Mt. Math. Publ. 9, 15--30 (1996; Zbl 0855.05065)
Schiermeyer, Ingo Deciding 3-colourability in less than \(O(1.415^n)\) steps. (English) Zbl 07784160 van Leeuwen, Jan (ed.), WG ’93. Graph-theoretic concepts in computer science, 19th international workshop, Utrecht, the Netherlands, June 16–18, 1993. Proceedings. Berlin: Springer. Lect. Notes Comput. Sci. 790, 177-188 (1994). MSC: 05C85 05C15 68W40 68Q25 PDFBibTeX XMLCite \textit{I. Schiermeyer}, Lect. Notes Comput. Sci. 790, 177--188 (1994; Zbl 07784160) Full Text: DOI