Boode, Antoon H.; Broersma, Hajo Decompositions of graphs based on a new graph product. (English) Zbl 1407.05190 Discrete Appl. Math. 259, 31-40 (2019). MSC: 05C70 05C76 PDFBibTeX XMLCite \textit{A. H. Boode} and \textit{H. Broersma}, Discrete Appl. Math. 259, 31--40 (2019; Zbl 1407.05190) Full Text: DOI
Li, Binlong; Broersma, Hajo; Zhang, Shenggui Conditions for graphs to be path partition optimal. (English) Zbl 1383.05187 Discrete Math. 341, No. 5, 1350-1358 (2018). MSC: 05C45 05C38 05C70 05C35 05C40 PDFBibTeX XMLCite \textit{B. Li} et al., Discrete Math. 341, No. 5, 1350--1358 (2018; Zbl 1383.05187) Full Text: DOI
Zhang, Xiaoyan; Zhang, Zan-Bo; Broersma, Hajo; Wen, Xuelian On the complexity of edge-colored subgraph partitioning problems in network optimization. (English) Zbl 1343.05067 Discrete Math. Theor. Comput. Sci. 17, No. 3, 227-244 (2016). MSC: 05C15 05C70 05C82 PDFBibTeX XMLCite \textit{X. Zhang} et al., Discrete Math. Theor. Comput. Sci. 17, No. 3, 227--244 (2016; Zbl 1343.05067) Full Text: Link
Wang, Limin; Zhang, Xiaoyan; Zhang, Zhao; Broersma, Hajo A PTAS for the minimum weight connected vertex cover \(P_3\) problem on unit disk graphs. (English) Zbl 1312.68234 Theor. Comput. Sci. 571, 58-66 (2015). MSC: 68W25 05C62 05C70 05C85 68Q17 PDFBibTeX XMLCite \textit{L. Wang} et al., Theor. Comput. Sci. 571, 58--66 (2015; Zbl 1312.68234) Full Text: DOI
Li, MingChu; Yuan, Lifeng; Jiang, He; Liu, Bing; Broersma, H. J. Tank-ring factors in supereulerian claw-free graphs. (English) Zbl 1267.05209 Graphs Comb. 29, No. 3, 599-608 (2013). MSC: 05C70 05C35 05C45 PDFBibTeX XMLCite \textit{M. Li} et al., Graphs Comb. 29, No. 3, 599--608 (2013; Zbl 1267.05209) Full Text: DOI
Broersma, Hajo; Kratsch, Dieter; Woeginger, Gerhard J. Fully decomposable split graphs. (English) Zbl 1257.05125 Eur. J. Comb. 34, No. 3, 567-575 (2013). MSC: 05C70 05C85 PDFBibTeX XMLCite \textit{H. Broersma} et al., Eur. J. Comb. 34, No. 3, 567--575 (2013; Zbl 1257.05125) Full Text: DOI
Broersma, Hajo; Paulusma, Daniël Computing sharp 2-factors in claw-free graphs. (English) Zbl 1231.05210 J. Discrete Algorithms 8, No. 3, 321-329 (2010). MSC: 05C70 05C45 PDFBibTeX XMLCite \textit{H. Broersma} and \textit{D. Paulusma}, J. Discrete Algorithms 8, No. 3, 321--329 (2010; Zbl 1231.05210) Full Text: DOI
Broersma, Hajo; Paulusma, Daniël; Yoshimoto, Kiyoshi Sharp upper bounds on the minimum number of components of 2-factors in claw-free graphs. (English) Zbl 1210.05064 Graphs Comb. 25, No. 4, 427-460 (2009). Reviewer: Ya-Chen Chen (San Francisco) MSC: 05C35 05C70 PDFBibTeX XMLCite \textit{H. Broersma} et al., Graphs Comb. 25, No. 4, 427--460 (2009; Zbl 1210.05064) Full Text: DOI Link
Broersma, Hajo; Kratsch, Dieter; Woeginger, Gerhard J. Fully decomposable split graphs. (English) Zbl 1267.05245 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, 105-112 (2009). MSC: 05C85 05C70 68Q25 PDFBibTeX XMLCite \textit{H. Broersma} et al., Lect. Notes Comput. Sci. 5874, 105--112 (2009; Zbl 1267.05245) Full Text: DOI Link
Broersma, Hajo; Marchal, Bert; Paulusma, Daniel; Salman, A. N. M. Backbone colorings along stars and matchings in split graphs: their span is close to the chromatic number. (English) Zbl 1181.05036 Discuss. Math., Graph Theory 29, No. 1, 143-162 (2009). MSC: 05C15 05C85 05C17 PDFBibTeX XMLCite \textit{H. Broersma} et al., Discuss. Math., Graph Theory 29, No. 1, 143--162 (2009; Zbl 1181.05036) Full Text: DOI Link
Broersma, Hajo; Paulusma, Daniël Computing sharp 2-factors in claw-free graphs. (English) Zbl 1173.05348 Ochmański, Edward (ed.) et al., Mathematical foundations of computer science 2008. 33rd international symposium, MFCS 2008, Toruń Poland, August 25–29, 2008. Proceedings. Berlin: Springer (ISBN 978-3-540-85237-7/pbk). Lecture Notes in Computer Science 5162, 193-204 (2008). MSC: 05C85 05C70 68Q25 PDFBibTeX XMLCite \textit{H. Broersma} and \textit{D. Paulusma}, Lect. Notes Comput. Sci. 5162, 193--204 (2008; Zbl 1173.05348) Full Text: DOI Link
Li, Mingchu; Xiong, Liming; Broersma, H. J. Connected even factors in claw-free graphs. (English) Zbl 1143.05067 Discrete Math. 308, No. 11, 2282-2284 (2008). Reviewer: Dalibor Fronček (Duluth) MSC: 05C70 PDFBibTeX XMLCite \textit{M. Li} et al., Discrete Math. 308, No. 11, 2282--2284 (2008; Zbl 1143.05067) Full Text: DOI Link
Broersma, Hajo; Marchal, Bert; Paulusma, Daniel; Salman, A. N. M. Improved upper bounds for \(\lambda \)-backbone colorings along matchings and stars. (English) Zbl 1131.05301 van Leeuwen, Jan (ed.) et al., SOFSEM 2007: Theory and practice of computer science. 33rd conference on current trends in theory and practice of computer science, Harrachov, Czech Republic, January 20–26, 2007. Proceedings. Berlin: Springer (ISBN 978-3-540-69506-6/pbk). Lecture Notes in Computer Science 4362, 188-199 (2007). MSC: 05C15 05C70 05C85 68R10 PDFBibTeX XMLCite \textit{H. Broersma} et al., Lect. Notes Comput. Sci. 4362, 188--199 (2007; Zbl 1131.05301) Full Text: DOI
Bauer, D.; Broersma, H. J.; Morgana, A.; Schmeichel, E. Tutte sets in graphs. I: Maximal Tutte sets and \(D\)-graphs. (English) Zbl 1120.05067 J. Graph Theory 55, No. 4, 343-358 (2007). MSC: 05C70 PDFBibTeX XMLCite \textit{D. Bauer} et al., J. Graph Theory 55, No. 4, 343--358 (2007; Zbl 1120.05067) Full Text: DOI
Bauer, D.; Broersma, H. J.; Kahl, N.; Morgana, A.; Schmeichel, E.; Surowiec, T. Tutte sets in graphs. II: The complexity of finding maximum Tutte sets. (English) Zbl 1119.05086 Discrete Appl. Math. 155, No. 10, 1336-1343 (2007). MSC: 05C70 05C75 PDFBibTeX XMLCite \textit{D. Bauer} et al., Discrete Appl. Math. 155, No. 10, 1336--1343 (2007; Zbl 1119.05086) Full Text: DOI Link
Broersma, Hajo; Fomin, Fedor V.; Královič, Rastislav; Woeginger, Gerhard J. Eliminating graphs by means of parallel knock-out schemes. (English) Zbl 1109.05091 Discrete Appl. Math. 155, No. 2, 92-102 (2007). MSC: 05C75 05C35 05C85 68R10 PDFBibTeX XMLCite \textit{H. Broersma} et al., Discrete Appl. Math. 155, No. 2, 92--102 (2007; Zbl 1109.05091) Full Text: DOI
Broersma, Hajo; Fomin, Fedor V.; Kratochvil, Jan; Woeginger, Gerhard J. Planar graph coloring avoiding monochromatic subgraphs: Trees and paths make it difficult. (English) Zbl 1095.68075 Algorithmica 44, No. 4, 343-361 (2006). MSC: 68R10 68Q25 05C15 05C70 PDFBibTeX XMLCite \textit{H. Broersma} et al., Algorithmica 44, No. 4, 343--361 (2006; Zbl 1095.68075) Full Text: DOI Link
Salman, A. N. M.; Broersma, H. J.; Rodger, C. A. More on spanning 2-connected subgraphs of alphabet graphs, special classes of grid graphs. (English) Zbl 1078.05056 Bull. Inst. Comb. Appl. 45, 17-32 (2005). Reviewer: Van Bang Le (Rostock) MSC: 05C45 05C70 68R10 PDFBibTeX XMLCite \textit{A. N. M. Salman} et al., Bull. Inst. Comb. Appl. 45, 17--32 (2005; Zbl 1078.05056)
Broersma, H. J.; Kriesell, M.; Ryjáček, Z. On factors of 4-connected claw-free graphs. (English) Zbl 0984.05067 J. Graph Theory 37, No. 2, 125-136 (2001). Reviewer: Lutz Volkmann (Aachen) MSC: 05C70 05C45 05C38 PDFBibTeX XMLCite \textit{H. J. Broersma} et al., J. Graph Theory 37, No. 2, 125--136 (2001; Zbl 0984.05067) Full Text: DOI Link
Böhme, Thomas; Broersma, Hajo; Tuinstra, Hilde A note on a conjecture concerning tree-partitioning \(3\)-regular graphs. (English) Zbl 0951.05083 Tatra Mt. Math. Publ. 18, 15-21 (1999). Reviewer: Jaroslav Ivančo (Košice) MSC: 05C70 05C45 05C38 05C35 05C05 PDFBibTeX XMLCite \textit{T. Böhme} et al., Tatra Mt. Math. Publ. 18, 15--21 (1999; Zbl 0951.05083)
Broersma, H. J.; Ryjáček, Z.; Schiermeyer, I. Dirac’s minimum degree condition restricted to claws. (English) Zbl 0880.05062 Discrete Math. 167-168, 155-166 (1997). Reviewer: R.Faudree (Memphis) MSC: 05C45 05C70 05C35 PDFBibTeX XMLCite \textit{H. J. Broersma} et al., Discrete Math. 167--168, 155--166 (1997; Zbl 0880.05062) Full Text: DOI