Dong, Yanni; Broersma, Hajo; Bai, Yuhang; Zhang, Shenggui The complexity of spanning tree problems involving graphical indices. (English) Zbl 07809932 Discrete Appl. Math. 347, 143-154 (2024). MSC: 05C05 05C09 68Q17 92E10 05C92 PDFBibTeX XMLCite \textit{Y. Dong} et al., Discrete Appl. Math. 347, 143--154 (2024; Zbl 07809932) Full Text: DOI
Yang, Xiuwen; Broersma, Hajo; Wang, Ligong The \(A_\alpha\) spectral moments of digraphs with a given dichromatic number. (English) Zbl 07799867 Linear Algebra Appl. 685, 77-103 (2024). MSC: 05C20 05C35 05C50 PDFBibTeX XMLCite \textit{X. Yang} et al., Linear Algebra Appl. 685, 77--103 (2024; Zbl 07799867) Full Text: DOI
Wu, Fangfang; Broersma, Hajo; Zhang, Shenggui; Li, Binlong Properly colored and rainbow \({C_4}^\prime \text{s}\) in edge-colored graphs. (English) Zbl 07783197 J. Graph Theory 105, No. 1, 110-135 (2024). Reviewer: Linda Lesniak (Kalamazoo) MSC: 05C15 05C35 PDFBibTeX XMLCite \textit{F. Wu} et al., J. Graph Theory 105, No. 1, 110--135 (2024; Zbl 07783197) Full Text: DOI OA License
Yang, Xiuwen; Broersma, Hajo; Wang, Ligong Sharp bounds for Laplacian spectral moments of digraphs with a fixed dichromatic number. (English) Zbl 1525.05123 Discrete Math. 347, No. 1, Article ID 113659, 17 p. (2024). MSC: 05C50 05C20 PDFBibTeX XMLCite \textit{X. Yang} et al., Discrete Math. 347, No. 1, Article ID 113659, 17 p. (2024; Zbl 1525.05123) Full Text: DOI arXiv
Han, Tingting; Broersma, Hajo; Bai, Yandong; Zhang, Shenggui Sufficient conditions for properly colored \(C_3\)’s and \(C_4\)’s in edge-colored complete graphs. (English) Zbl 1506.05064 Discrete Appl. Math. 327, 101-109 (2023). MSC: 05C15 05C07 05C35 PDFBibTeX XMLCite \textit{T. Han} et al., Discrete Appl. Math. 327, 101--109 (2023; Zbl 1506.05064) Full Text: DOI
Dong, Yanni; Broersma, Hajo; Song, Changwu; Wan, Pengfei; Zhang, Shenggui The effect of graph operations on the degree-based entropy. (English) Zbl 1510.05252 Appl. Math. Comput. 437, Article ID 127533, 14 p. (2023). MSC: 05C76 PDFBibTeX XMLCite \textit{Y. Dong} et al., Appl. Math. Comput. 437, Article ID 127533, 14 p. (2023; Zbl 1510.05252) Full Text: DOI
Li, Xihe; Broersma, Hajo; Wang, Ligong The Erdős-Gyárfás function with respect to Gallai-colorings. (English) Zbl 1522.05295 J. Graph Theory 101, No. 2, 242-264 (2022). MSC: 05C55 05D10 05C15 PDFBibTeX XMLCite \textit{X. Li} et al., J. Graph Theory 101, No. 2, 242--264 (2022; Zbl 1522.05295) Full Text: DOI arXiv OA License
Zheng, Wei; Broersma, Hajo; Wang, Ligong Toughness, forbidden subgraphs, and Hamilton-connected graphs. (English) Zbl 1479.05183 Discuss. Math., Graph Theory 42, No. 1, 187-196 (2022). MSC: 05C45 05C38 05C42 PDFBibTeX XMLCite \textit{W. Zheng} et al., Discuss. Math., Graph Theory 42, No. 1, 187--196 (2022; Zbl 1479.05183) Full Text: DOI
Zheng, Wei; Broersma, Hajo; Wang, Ligong Toughness, forbidden subgraphs and pancyclicity. (English) Zbl 1470.05092 Graphs Comb. 37, No. 3, 839-866 (2021). MSC: 05C38 05C42 05C45 05C60 PDFBibTeX XMLCite \textit{W. Zheng} et al., Graphs Comb. 37, No. 3, 839--866 (2021; Zbl 1470.05092) Full Text: DOI
Li, Fengwei; Ye, Qingfang; Broersma, Hajo; Ye, Ruixuan; Zhang, Xiaoyan Extremality of VDB topological indices over f-benzenoids with given order. (English) Zbl 1508.05033 Appl. Math. Comput. 393, Article ID 125757, 12 p. (2021). MSC: 05C09 05C92 92E10 PDFBibTeX XMLCite \textit{F. Li} et al., Appl. Math. Comput. 393, Article ID 125757, 12 p. (2021; Zbl 1508.05033) 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
Li, Fengwei; Li, Xueliang; Broersma, Hajo Spectral properties of inverse sum indeg index of graphs. (English) Zbl 1448.92394 J. Math. Chem. 58, No. 9, 2108-2139 (2020). MSC: 92E10 05C92 PDFBibTeX XMLCite \textit{F. Li} et al., J. Math. Chem. 58, No. 9, 2108--2139 (2020; Zbl 1448.92394) Full Text: DOI
Tian, Tao; Broersma, Hajo; Xiong, Liming On sufficient degree conditions for traceability of claw-free graphs. (English) Zbl 1440.05163 Discrete Math. 343, No. 7, Article ID 111883, 9 p. (2020). MSC: 05C69 PDFBibTeX XMLCite \textit{T. Tian} et al., Discrete Math. 343, No. 7, Article ID 111883, 9 p. (2020; Zbl 1440.05163) Full Text: DOI
Li, Fengwei; Zhang, Xiaoyan; Broersma, Hajo A polynomial algorithm for weighted scattering number in interval graphs. (English) Zbl 1414.05276 Discrete Appl. Math. 264, 118-124 (2019). MSC: 05C85 05C45 05C40 05C22 68Q25 PDFBibTeX XMLCite \textit{F. Li} et al., Discrete Appl. Math. 264, 118--124 (2019; Zbl 1414.05276) 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
Li, Fengwei; Broersma, Hajo; Rada, Juan; Sun, Yuefang Extremal benzenoid systems for two modified versions of the Randić index. (English) Zbl 1427.92102 Appl. Math. Comput. 337, 14-24 (2018). MSC: 92E10 05C90 PDFBibTeX XMLCite \textit{F. Li} et al., Appl. Math. Comput. 337, 14--24 (2018; Zbl 1427.92102) Full Text: DOI
Li, Ruonan; Broersma, Hajo; Xu, Chuandong; Zhang, Shenggui Cycle extension in edge-colored complete graphs. (English) Zbl 1369.05080 Discrete Math. 340, No. 6, 1235-1241 (2017). MSC: 05C15 05C38 PDFBibTeX XMLCite \textit{R. Li} et al., Discrete Math. 340, No. 6, 1235--1241 (2017; Zbl 1369.05080) Full Text: DOI
Li, Binlong; Zhang, Yanbo; Broersma, Hajo An exact formula for all star-kipas Ramsey numbers. (English) Zbl 1365.05194 Graphs Comb. 33, No. 1, 141-148 (2017). MSC: 05C55 05D10 PDFBibTeX XMLCite \textit{B. Li} et al., Graphs Comb. 33, No. 1, 141--148 (2017; Zbl 1365.05194) Full Text: DOI
Li, Binlong; Broersma, Hajo J.; Zhang, Shenggui Forbidden subgraphs for Hamiltonicity of 1-tough graphs. (English) Zbl 1350.05088 Discuss. Math., Graph Theory 36, No. 4, 915-929 (2016). MSC: 05C45 PDFBibTeX XMLCite \textit{B. Li} et al., Discuss. Math., Graph Theory 36, No. 4, 915--929 (2016; Zbl 1350.05088) Full Text: DOI
Zhang, Yanbo; Broersma, Hajo; Chen, Yaojun On fan-wheel and tree-wheel Ramsey numbers. (English) Zbl 1338.05180 Discrete Math. 339, No. 9, 2284-2287 (2016). MSC: 05C55 PDFBibTeX XMLCite \textit{Y. Zhang} et al., Discrete Math. 339, No. 9, 2284--2287 (2016; Zbl 1338.05180) Full Text: DOI
Zhang, Yanbo; Broersma, Hajo; Chen, Yaojun On star-critical and upper size Ramsey numbers. (English) Zbl 1330.05157 Discrete Appl. Math. 202, 174-180 (2016). MSC: 05D10 05C55 PDFBibTeX XMLCite \textit{Y. Zhang} et al., Discrete Appl. Math. 202, 174--180 (2016; Zbl 1330.05157) Full Text: DOI
Zhang, Yanbo; Broersma, Hajo; Chen, Yaojun Three results on cycle-wheel Ramsey numbers. (English) Zbl 1327.05232 Graphs Comb. 31, No. 6, 2467-2479 (2015). MSC: 05C55 05C38 PDFBibTeX XMLCite \textit{Y. Zhang} et al., Graphs Comb. 31, No. 6, 2467--2479 (2015; Zbl 1327.05232) Full Text: DOI
Li, Binlong; Zhang, Yanbo; Bielak, Halina; Broersma, Hajo; Holub, Premek Closing the gap on path-kipas Ramsey numbers. (English) Zbl 1327.05229 Electron. J. Comb. 22, No. 3, Research Paper P3.21, 7 p. (2015). MSC: 05C55 05D10 PDFBibTeX XMLCite \textit{B. Li} et al., Electron. J. Comb. 22, No. 3, Research Paper P3.21, 7 p. (2015; Zbl 1327.05229) Full Text: Link
Zhang, Yanbo; Broersma, Hajo; Chen, Yaojun A note on Ramsey numbers for fans. (English) Zbl 1319.05134 Bull. Aust. Math. Soc. 92, No. 1, 19-23 (2015). MSC: 05D10 05C70 PDFBibTeX XMLCite \textit{Y. Zhang} et al., Bull. Aust. Math. Soc. 92, No. 1, 19--23 (2015; Zbl 1319.05134) Full Text: DOI
Broersma, Hajo; Fiala, Jiří; Golovach, Petr A.; Kaiser, Tomáš; Paulusma, Daniël; Proskurowski, Andrzej Linear-time algorithms for scattering number and Hamilton-connectivity of interval graphs. (English) Zbl 1316.05080 J. Graph Theory 79, No. 4, 282-299 (2015). MSC: 05C40 05C85 05C45 PDFBibTeX XMLCite \textit{H. Broersma} et al., J. Graph Theory 79, No. 4, 282--299 (2015; Zbl 1316.05080) Full Text: DOI arXiv Link
Bauer, D.; Broersma, H. J.; Den Heuvel, J.van; Kahl, N.; Nevo, A.; Schmeichel, E.; Woodall, D. R.; Yatauro, M. Best monotone degree conditions for graph properties: a survey. (English) Zbl 1306.05032 Graphs Comb. 31, No. 1, 1-22 (2015). MSC: 05C07 PDFBibTeX XMLCite \textit{D. Bauer} et al., Graphs Comb. 31, No. 1, 1--22 (2015; Zbl 1306.05032) Full Text: DOI arXiv
Broersma, Hajo; Patel, Viresh; Pyatkin, Artem On toughness and Hamiltonicity of \(2K_{2}\)-free graphs. (English) Zbl 1292.05162 J. Graph Theory 75, No. 3, 244-255 (2014). MSC: 05C45 PDFBibTeX XMLCite \textit{H. Broersma} et al., J. Graph Theory 75, No. 3, 244--255 (2014; Zbl 1292.05162) Full Text: DOI
Broersma, Hajo; Golovach, Petr A.; Patel, Viresh Tight complexity bounds for FPT subgraph problems parameterized by the clique-width. (English) Zbl 1297.05163 Theor. Comput. Sci. 485, 69-84 (2013). MSC: 05C60 68Q25 PDFBibTeX XMLCite \textit{H. Broersma} et al., Theor. Comput. Sci. 485, 69--84 (2013; Zbl 1297.05163) Full Text: DOI
Broersma, Hajo; Fomin, Fedor V.; van ’t Hof, Pim; Paulusma, Daniël Exact algorithms for finding longest cycles in claw-free graphs. (English) Zbl 1259.05162 Algorithmica 65, No. 1, 129-145 (2013). MSC: 05C85 05C45 05C38 68Q17 PDFBibTeX XMLCite \textit{H. Broersma} et al., Algorithmica 65, No. 1, 129--145 (2013; Zbl 1259.05162) Full Text: DOI Link
Bonsma, Paul; Broersma, Hajo; Patel, Viresh; Pyatkin, Artem The complexity of finding uniform sparsest cuts in various graph classes. (English) Zbl 1248.05208 J. Discrete Algorithms 14, 136-149 (2012). MSC: 05C99 05C85 68Q17 PDFBibTeX XMLCite \textit{P. Bonsma} et al., J. Discrete Algorithms 14, 136--149 (2012; Zbl 1248.05208) Full Text: DOI
Broersma, Hajo; Golovach, Petr A.; Patel, Viresh Tight complexity bounds for FPT subgraph problems parameterized by clique-width. (English) Zbl 1352.68095 Marx, Dániel (ed.) et al., Parameterized and exact computation. 6th international symposium, IPEC 2011, Saarbrücken, Germany, September 6–8, 2011. Revised selected papers. Berlin: Springer (ISBN 978-3-642-28049-8/pbk). Lecture Notes in Computer Science 7112, 207-218 (2012). MSC: 68Q25 05C85 PDFBibTeX XMLCite \textit{H. Broersma} et al., Lect. Notes Comput. Sci. 7112, 207--218 (2012; Zbl 1352.68095) Full Text: DOI
Broersma, Hajo; Golovach, Petr A.; Paulusma, Daniël; Song, Jian Determining the chromatic number of triangle-free \(2P_3\)-free graphs in polynomial time. (English) Zbl 1241.05030 Theor. Comput. Sci. 423, 1-10 (2012). MSC: 05C15 68Q17 PDFBibTeX XMLCite \textit{H. Broersma} et al., Theor. Comput. Sci. 423, 1--10 (2012; Zbl 1241.05030) Full Text: DOI
Broersma, Hajo; Golovach, Petr A.; Paulusma, Daniël; Song, Jian Updating the complexity status of coloring graphs without a fixed induced linear forest. (English) Zbl 1234.68129 Theor. Comput. Sci. 414, No. 1, 9-19 (2012). MSC: 68Q17 05C15 PDFBibTeX XMLCite \textit{H. Broersma} et al., Theor. Comput. Sci. 414, No. 1, 9--19 (2012; Zbl 1234.68129) 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
Bonsma, Paul; Broersma, Hajo; Patel, Viresh; Pyatkin, Artem The complexity status of problems related to sparsest cuts. (English) Zbl 1326.68145 Iliopoulos, Costas S. (ed.) et al., Combinatorial algorithms. 21st international workshop, IWOCA 2010, London, UK, July 26–28, 2010. Revised selected papers. Berlin: Springer (ISBN 978-3-642-19221-0/pbk). Lecture Notes in Computer Science 6460, 125-135 (2011). MSC: 68Q17 05C35 68Q25 PDFBibTeX XMLCite \textit{P. Bonsma} et al., Lect. Notes Comput. Sci. 6460, 125--135 (2011; Zbl 1326.68145) Full Text: DOI
Broersma, Hajo; Golovach, Petr A.; Paulusma, Daniël; Song, Jian Narrowing down the gap on the complexity of coloring \(P _{k }\)-free graphs. (English) Zbl 1308.68063 Thilikos, Dimitrios M. (ed.), Graph theoretic concepts in computer science. 36th international workshop, WG 2010, Zarós, Crete, Greece, June 28–30, 2010. Revised papers. Berlin: Springer (ISBN 978-3-642-16925-0/pbk). Lecture Notes in Computer Science 6410, 63-74 (2010). MSC: 68Q25 05C15 68Q17 PDFBibTeX XMLCite \textit{H. Broersma} et al., Lect. Notes Comput. Sci. 6410, 63--74 (2010; Zbl 1308.68063) Full Text: DOI
Broersma, H. J.; Fujisawa, J.; Marchal, L.; Paulusma, D.; Salman, A. N. M.; Yoshimoto, K. \(\lambda \)-backbone colorings along pairwise disjoint stars and matchings. (English) Zbl 1213.05068 Discrete Math. 309, No. 18, 5596-5609 (2009). MSC: 05C15 05C70 PDFBibTeX XMLCite \textit{H. J. Broersma} et al., Discrete Math. 309, No. 18, 5596--5609 (2009; Zbl 1213.05068) Full Text: DOI
Broersma, Hajo; Johnson, Matthew; Paulusma, Daniël Upper bounds and algorithms for parallel knock-out numbers. (English) Zbl 1164.68026 Theor. Comput. Sci. 410, No. 14, 1319-1327 (2009). MSC: 68R10 PDFBibTeX XMLCite \textit{H. Broersma} et al., Theor. Comput. Sci. 410, No. 14, 1319--1327 (2009; Zbl 1164.68026) Full Text: DOI Link
Wang, Ligong; Broersma, Hajo; Hoede, Cornelis; Li, Xueliang; Still, Georg Some families of integral graphs. (English) Zbl 1171.05364 Discrete Math. 308, No. 24, 6383-6391 (2008). MSC: 05C50 PDFBibTeX XMLCite \textit{L. Wang} et al., Discrete Math. 308, No. 24, 6383--6391 (2008; Zbl 1171.05364) Full Text: DOI Link
Broersma, Hajo; Johnson, Matthew; Paulusma, Daniël; Stewart, Iain A. The computational complexity of the parallel knock-out problem. (English) Zbl 1136.68028 Theor. Comput. Sci. 393, No. 1-3, 182-195 (2008). MSC: 68Q17 68Q25 68R10 PDFBibTeX XMLCite \textit{H. Broersma} et al., Theor. Comput. Sci. 393, No. 1--3, 182--195 (2008; Zbl 1136.68028) Full Text: DOI Link
Salman, A. N. M.; Broersma, H. J. Path-kipas Ramsey numbers. (English) Zbl 1128.05037 Discrete Appl. Math. 155, No. 14, 1878-1884 (2007). Reviewer: Ralph Faudree (Memphis) MSC: 05C55 05D10 PDFBibTeX XMLCite \textit{A. N. M. Salman} and \textit{H. J. Broersma}, Discrete Appl. Math. 155, No. 14, 1878--1884 (2007; Zbl 1128.05037) Full Text: DOI
Wang, Ligong; Broersma, Hajo; Hoede, Cornelis; Li, Xueliang; Still, Georg Integral trees of diameter 6. (English) Zbl 1119.05070 Discrete Appl. Math. 155, No. 10, 1254-1266 (2007). MSC: 05C50 05C05 11D09 11D41 PDFBibTeX XMLCite \textit{L. Wang} et al., Discrete Appl. Math. 155, No. 10, 1254--1266 (2007; Zbl 1119.05070) Full Text: DOI Link
Salman, A. N. M.; Broersma, H. J. On Ramsey numbers for paths versus wheels. (English) Zbl 1115.05060 Discrete Math. 307, No. 7-8, 975-982 (2007). Reviewer: Saul Stahl (Lawrence) MSC: 05C55 PDFBibTeX XMLCite \textit{A. N. M. Salman} and \textit{H. J. Broersma}, Discrete Math. 307, No. 7--8, 975--982 (2007; Zbl 1115.05060) Full Text: DOI Link
Broersma, Hajo; Xiong, Liming; Yoshimoto, Kiyoshi Toughness and Hamiltonicity in \(k\)-trees. (English) Zbl 1117.05069 Discrete Math. 307, No. 7-8, 832-838 (2007). Reviewer: William G. Brown (Montréal) MSC: 05C45 05C35 05C38 05C40 PDFBibTeX XMLCite \textit{H. Broersma} et al., Discrete Math. 307, No. 7--8, 832--838 (2007; Zbl 1117.05069) Full Text: DOI
Bauer, Douglas; Broersma, Hajo; Schmeichel, Edward Toughness in graphs – a survey. (English) Zbl 1088.05045 Graphs Comb. 22, No. 1, 1-35 (2006). MSC: 05C40 05C45 68R10 05-02 PDFBibTeX XMLCite \textit{D. Bauer} et al., Graphs Comb. 22, No. 1, 1--35 (2006; Zbl 1088.05045) Full Text: DOI
Salman, A. N. M.; Broersma, H. J. The Ramsey numbers of paths versus kipases. (English) Zbl 1125.05314 Liberti, Leo (ed.) et al., Workshop on graphs and combinatorial optimization. Papers from the workshop, Como, Italy, May 31, 2004. Amsterdam: Elsevier. Electronic Notes in Discrete Mathematics 17, 251-255 (2004). MSC: 05C55 05D10 PDFBibTeX XMLCite \textit{A. N. M. Salman} and \textit{H. J. Broersma}, Electron. Notes Discrete Math. 17, 251--255 (2004; Zbl 1125.05314) Full Text: DOI
Bauer, Doug; Broersma, Hajo; Schmeichel, Edward More progress on tough graphs – the Y2K report. (English) Zbl 1075.05559 Alavi, Yousef (ed.) et al., Papers of the 9th quadrennial international conference on graph theory, combinatorics, algorithms, and applications, Kalamazoo, MI, USA, June 4–9, 2000. Amsterdam: Elsevier. Electronic Notes in Discrete Mathematics 11, 63-80 (2002). MSC: 05C40 PDFBibTeX XMLCite \textit{D. Bauer} et al., Electron. Notes Discrete Math. 11, 63--80 (2002; Zbl 1075.05559) Full Text: Link
Bauer, D.; Broersma, H. J.; Morgana, A.; Schmeichel, E. Polynomial algorithms that prove an NP-hard hypothesis implies an NP-hard conclusion. (English) Zbl 1052.68097 Discrete Appl. Math. 120, No. 1-3, 13-23 (2002). MSC: 68R10 05C38 68Q25 68Q17 PDFBibTeX XMLCite \textit{D. Bauer} et al., Discrete Appl. Math. 120, No. 1--3, 13--23 (2002; Zbl 1052.68097) Full Text: DOI
Broersma, H. J.; Dahlhaus, E.; Kloks, T. A linear time algorithm for minimum fill-in and treewidth for distance hereditary graphs. (English) Zbl 0940.05064 Discrete Appl. Math. 99, No. 1-3, 367-400 (2000). Reviewer: H.L.Bodlaender (Utrecht) MSC: 05C85 68R10 05C12 05C05 PDFBibTeX XMLCite \textit{H. J. Broersma} et al., Discrete Appl. Math. 99, No. 1--3, 367--400 (2000; Zbl 0940.05064) Full Text: DOI
Bauer, D.; Broersma, H. J.; Veldman, H. J. Not every 2-tough graph is Hamiltonian. (English) Zbl 0934.05083 Discrete Appl. Math. 99, No. 1-3, 317-321 (2000). Reviewer: R.J.Faudree (Memphis) MSC: 05C45 05C38 05C35 PDFBibTeX XMLCite \textit{D. Bauer} et al., Discrete Appl. Math. 99, No. 1--3, 317--321 (2000; Zbl 0934.05083) Full Text: DOI
Broersma, Hajo; Kloks, Ton; Kratsch, Dieter; Müller, Haiko Independent sets in asteroidal triple-free graphs. (English) Zbl 1401.05278 Degano, Pierpaolo (ed.) et al., Automata, languages and programming. 24th international colloquium, ICALP ’97, Bologna, Italy, July 7–11, 1997. Proceedings. Berlin: Springer-Verlag (ISBN 978-3-540-63165-1/pbk; 978-3-540-69194-5/ebook). Lecture Notes in Computer Science 1256, 760-770 (1997). MSC: 05C85 05C69 68R10 68W40 PDFBibTeX XMLCite \textit{H. Broersma} et al., Lect. Notes Comput. Sci. 1256, 760--770 (1997; Zbl 1401.05278) Full Text: DOI
Broersma, H. J.; Schiermeyer, I. Subgraphs, closures and hamiltonicity. (English) Zbl 0811.05041 Discrete Appl. Math. 51, No. 1-2, 39-46 (1994). Reviewer: E.Prisner (Hamburg) MSC: 05C45 PDFBibTeX XMLCite \textit{H. J. Broersma} and \textit{I. Schiermeyer}, Discrete Appl. Math. 51, No. 1--2, 39--46 (1994; Zbl 0811.05041) Full Text: DOI
Broersma, H. J.; Schiermeyer, I. A closure concept based on neighborhood unions of independent triples. (English) Zbl 0789.05059 Discrete Math. 124, No. 1-3, 37-47 (1994). Reviewer: B.Zelinka (Liberec) MSC: 05C45 PDFBibTeX XMLCite \textit{H. J. Broersma} and \textit{I. Schiermeyer}, Discrete Math. 124, No. 1--3, 37--47 (1994; Zbl 0789.05059) Full Text: DOI
Broersma, H. J. A note on \(K_ 4\)-closures in hamiltonian graph theory. (English) Zbl 0789.05057 Discrete Math. 121, No. 1-3, 19-23 (1993). MSC: 05C45 PDFBibTeX XMLCite \textit{H. J. Broersma}, Discrete Math. 121, No. 1--3, 19--23 (1993; Zbl 0789.05057) Full Text: DOI
Broersma, H. J.; Li, Xueliang On “The matching polynomial of a polygraph”. (English) Zbl 0784.05051 Discrete Appl. Math. 46, No. 1, 79-86 (1993). Reviewer: H.N.V.Temperley (Langport) MSC: 05C70 PDFBibTeX XMLCite \textit{H. J. Broersma} and \textit{X. Li}, Discrete Appl. Math. 46, No. 1, 79--86 (1993; Zbl 0784.05051) Full Text: DOI