Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDBibTeX records: Hajo Broersma
@article{DBLP:journals/dm/YangBW24,
author = {Xiuwen Yang and
Hajo Broersma and
Ligong Wang},
title = {Sharp bounds for Laplacian spectral moments of digraphs with a fixed
dichromatic number},
journal = {Discret. Math.},
volume = {347},
number = {1},
pages = {113659},
year = {2024},
url = {https://doi.org/10.1016/j.disc.2023.113659},
doi = {10.1016/J.DISC.2023.113659},
timestamp = {Thu, 09 Nov 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dm/YangBW24.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgt/WuBZL24,
author = {Fangfang Wu and
Hajo Broersma and
Shenggui Zhang and
Binlong Li},
title = {Properly colored and rainbow {C} 4 {\textdollar}\{C\}{\_}\{4\}{\textdollar}
's in edge-colored graphs},
journal = {J. Graph Theory},
volume = {105},
number = {1},
pages = {110--135},
year = {2024},
url = {https://doi.org/10.1002/jgt.23019},
doi = {10.1002/JGT.23019},
timestamp = {Wed, 24 Jan 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jgt/WuBZL24.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/amc/DongBSWZ23,
author = {Yanni Dong and
Hajo Broersma and
Changwu Song and
Pengfei Wan and
Shenggui Zhang},
title = {The effect of graph operations on the degree-based entropy},
journal = {Appl. Math. Comput.},
volume = {437},
pages = {127533},
year = {2023},
url = {https://doi.org/10.1016/j.amc.2022.127533},
doi = {10.1016/J.AMC.2022.127533},
timestamp = {Mon, 24 Oct 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/amc/DongBSWZ23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/concurrency/LiYBZ23,
author = {Fengwei Li and
Qingfang Ye and
Hajo Broersma and
Xiaoyan Zhang},
title = {Polynomial algorithms for computing the isolated toughness of interval
and split graphs},
journal = {Concurr. Comput. Pract. Exp.},
volume = {35},
number = {17},
year = {2023},
url = {https://doi.org/10.1002/cpe.6345},
doi = {10.1002/CPE.6345},
timestamp = {Sun, 06 Aug 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/concurrency/LiYBZ23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/HanBBZ23,
author = {Tingting Han and
Hajo Broersma and
Yandong Bai and
Shenggui Zhang},
title = {Sufficient conditions for properly colored C3's and C4's in edge-colored
complete graphs},
journal = {Discret. Appl. Math.},
volume = {327},
pages = {101--109},
year = {2023},
url = {https://doi.org/10.1016/j.dam.2022.12.020},
doi = {10.1016/J.DAM.2022.12.020},
timestamp = {Sat, 13 May 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/dam/HanBBZ23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2312-00601,
author = {Antonios Antoniadis and
Hajo Broersma and
Yang Meng},
title = {Online Graph Coloring with Predictions},
journal = {CoRR},
volume = {abs/2312.00601},
year = {2023},
url = {https://doi.org/10.48550/arXiv.2312.00601},
doi = {10.48550/ARXIV.2312.00601},
eprinttype = {arXiv},
eprint = {2312.00601},
timestamp = {Mon, 05 Feb 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-2312-00601.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/axioms/LiYB22,
author = {Fengwei Li and
Qingfang Ye and
Hajo Broersma},
title = {Some New Bounds for the Inverse Sum Indeg Energy of Graphs},
journal = {Axioms},
volume = {11},
number = {5},
pages = {243},
year = {2022},
url = {https://doi.org/10.3390/axioms11050243},
doi = {10.3390/AXIOMS11050243},
timestamp = {Mon, 28 Aug 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/axioms/LiYB22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/combinatorics/LiBW22,
author = {Xihe Li and
Hajo Broersma and
Ligong Wang},
title = {Integer Colorings with No Rainbow 3-Term Arithmetic Progression},
journal = {Electron. J. Comb.},
volume = {29},
number = {2},
year = {2022},
url = {https://doi.org/10.37236/10249},
doi = {10.37236/10249},
timestamp = {Tue, 21 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/combinatorics/LiBW22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dm/DaiZBZ22,
author = {Guowei Dai and
Zan{-}Bo Zhang and
Hajo Broersma and
Xiaoyan Zhang},
title = {The Hamiltonian properties in \emph{K}\({}_{\mbox{1, \emph{r}}}\)-free
split graphs},
journal = {Discret. Math.},
volume = {345},
number = {6},
pages = {112826},
year = {2022},
url = {https://doi.org/10.1016/j.disc.2022.112826},
doi = {10.1016/J.DISC.2022.112826},
timestamp = {Mon, 28 Aug 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/dm/DaiZBZ22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dm/LiuBW22,
author = {Xiangxiang Liu and
Hajo Broersma and
Ligong Wang},
title = {On a conjecture of Nikiforov involving a spectral radius condition
for a graph to contain all trees},
journal = {Discret. Math.},
volume = {345},
number = {12},
pages = {113112},
year = {2022},
url = {https://doi.org/10.1016/j.disc.2022.113112},
doi = {10.1016/J.DISC.2022.113112},
timestamp = {Mon, 28 Aug 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/dm/LiuBW22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dmgt/0008B022,
author = {Wei Zheng and
Hajo Broersma and
Ligong Wang},
title = {Toughness, forbidden subgraphs, and Hamiltonian-connected graphs},
journal = {Discuss. Math. Graph Theory},
volume = {42},
number = {1},
pages = {187--196},
year = {2022},
url = {https://doi.org/10.7151/dmgt.2247},
doi = {10.7151/DMGT.2247},
timestamp = {Wed, 15 Dec 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dmgt/0008B022.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgt/LiBW22,
author = {Xihe Li and
Hajo Broersma and
Ligong Wang},
title = {The Erd{\H{o}}s-Gy{\'{a}}rf{\'{a}}s function with respect
to Gallai-colorings},
journal = {J. Graph Theory},
volume = {101},
number = {2},
pages = {242--264},
year = {2022},
url = {https://doi.org/10.1002/jgt.22822},
doi = {10.1002/JGT.22822},
timestamp = {Tue, 12 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jgt/LiBW22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/amc/LiYBYZ21,
author = {Fengwei Li and
Qingfang Ye and
Hajo Broersma and
Ruixuan Ye and
Xiao{-}Yan Zhang},
title = {Extremality of {VDB} topological indices over f-benzenoids with given
order},
journal = {Appl. Math. Comput.},
volume = {393},
pages = {125757},
year = {2021},
url = {https://doi.org/10.1016/j.amc.2020.125757},
doi = {10.1016/J.AMC.2020.125757},
timestamp = {Mon, 03 Jan 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/amc/LiYBYZ21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/combinatorics/HuBHZ21,
author = {Dan Hu and
Hajo Broersma and
Jiangyou Hou and
Shenggui Zhang},
title = {On the Spectra of General Random Mixed Graphs},
journal = {Electron. J. Comb.},
volume = {28},
number = {1},
pages = {1},
year = {2021},
url = {https://doi.org/10.37236/9638},
doi = {10.37236/9638},
timestamp = {Thu, 23 Jun 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/combinatorics/HuBHZ21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/ZhouBWL21,
author = {Qiannan Zhou and
Hajo Broersma and
Ligong Wang and
Yong Lu},
title = {On sufficient spectral radius conditions for hamiltonicity},
journal = {Discret. Appl. Math.},
volume = {296},
pages = {26--38},
year = {2021},
url = {https://doi.org/10.1016/j.dam.2020.01.031},
doi = {10.1016/J.DAM.2020.01.031},
timestamp = {Thu, 14 Oct 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/dam/ZhouBWL21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dm/GuoBLZ21,
author = {Zhiwei Guo and
Hajo Broersma and
Binlong Li and
Shenggui Zhang},
title = {Almost eulerian compatible spanning circuits in edge-colored graphs},
journal = {Discret. Math.},
volume = {344},
number = {1},
pages = {112174},
year = {2021},
url = {https://doi.org/10.1016/j.disc.2020.112174},
doi = {10.1016/J.DISC.2020.112174},
timestamp = {Mon, 03 Jan 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dm/GuoBLZ21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dm/LiB021,
author = {Xihe Li and
Hajo Broersma and
Ligong Wang},
title = {Extremal problems and results related to Gallai-colorings},
journal = {Discret. Math.},
volume = {344},
number = {11},
pages = {112567},
year = {2021},
url = {https://doi.org/10.1016/j.disc.2021.112567},
doi = {10.1016/J.DISC.2021.112567},
timestamp = {Sun, 02 Oct 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/dm/LiB021.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dmgt/BroersmaMMW21,
author = {Hajo Broersma and
Qin Ma and
Yaping Mao and
Jichang Wu},
title = {Removable edges on a Hamilton cycle or outside a cycle in a 4-connected
graph},
journal = {Discuss. Math. Graph Theory},
volume = {41},
number = {2},
pages = {559--587},
year = {2021},
url = {https://doi.org/10.7151/dmgt.2209},
doi = {10.7151/DMGT.2209},
timestamp = {Mon, 03 Jan 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dmgt/BroersmaMMW21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ejgta/ZhengBW21,
author = {Wei Zheng and
Hajo Broersma and
Ligong Wang},
title = {On hamiltonicity of 1-tough triangle-free graphs},
journal = {Electron. J. Graph Theory Appl.},
volume = {9},
number = {2},
pages = {433--442},
year = {2021},
url = {https://doi.org/10.5614/ejgta.2021.9.2.15},
doi = {10.5614/EJGTA.2021.9.2.15},
timestamp = {Tue, 15 Nov 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ejgta/ZhengBW21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/gc/ZhengBW21,
author = {Wei Zheng and
Hajo Broersma and
Ligong Wang},
title = {Toughness, Forbidden Subgraphs and Pancyclicity},
journal = {Graphs Comb.},
volume = {37},
number = {3},
pages = {839--866},
year = {2021},
url = {https://doi.org/10.1007/s00373-021-02284-y},
doi = {10.1007/S00373-021-02284-Y},
timestamp = {Wed, 08 Dec 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/gc/ZhengBW21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/gc/ZhouBWL21,
author = {Qiannan Zhou and
Hajo Broersma and
Ligong Wang and
Yong Lu},
title = {Sufficient Spectral Radius Conditions for Hamilton-Connectivity of
k-Connected Graphs},
journal = {Graphs Comb.},
volume = {37},
number = {6},
pages = {2467--2485},
year = {2021},
url = {https://doi.org/10.1007/s00373-021-02369-8},
doi = {10.1007/S00373-021-02369-8},
timestamp = {Wed, 15 Dec 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/gc/ZhouBWL21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgt/LiBYY21,
author = {Ruonan Li and
Hajo Broersma and
Maho Yokota and
Kiyoshi Yoshimoto},
title = {Edge-colored complete graphs without properly colored even cycles:
{A} full characterization},
journal = {J. Graph Theory},
volume = {98},
number = {1},
pages = {110--124},
year = {2021},
url = {https://doi.org/10.1002/jgt.22684},
doi = {10.1002/JGT.22684},
timestamp = {Tue, 12 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jgt/LiBYY21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/neuromorphic/EulerIVBBW21,
author = {Hans{-}Christian Ruiz Euler and
Unai Alegre Ibarra and
Bram van de Ven and
Hajo Broersma and
Peter A. Bobbert and
Wilfred G. van der Wiel},
title = {Dopant network processing units: towards efficient neural network
emulators with high-capacity nanoelectronic nodes},
journal = {Neuromorph. Comput. Eng.},
volume = {1},
number = {2},
pages = {24002},
year = {2021},
url = {https://doi.org/10.1088/2634-4386/ac1a7f},
doi = {10.1088/2634-4386/AC1A7F},
timestamp = {Wed, 15 Dec 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/neuromorphic/EulerIVBBW21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dm/ZhengBWZ20,
author = {Wei Zheng and
Hajo Broersma and
Ligong Wang and
Shenggui Zhang},
title = {Conditions on subgraphs, degrees, and domination for hamiltonian properties
of graphs},
journal = {Discret. Math.},
volume = {343},
number = {1},
pages = {111644},
year = {2020},
url = {https://doi.org/10.1016/j.disc.2019.111644},
doi = {10.1016/J.DISC.2019.111644},
timestamp = {Wed, 08 Dec 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dm/ZhengBWZ20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dm/TianBX20,
author = {Tao Tian and
Hajo Broersma and
Liming Xiong},
title = {On sufficient degree conditions for traceability of claw-free graphs},
journal = {Discret. Math.},
volume = {343},
number = {7},
pages = {111883},
year = {2020},
url = {https://doi.org/10.1016/j.disc.2020.111883},
doi = {10.1016/J.DISC.2020.111883},
timestamp = {Thu, 14 Oct 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/dm/TianBX20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/GuoBLZ20,
author = {Zhiwei Guo and
Hajo Broersma and
Ruonan Li and
Shenggui Zhang},
title = {Some algorithmic results for finding compatible spanning circuits
in edge-colored graphs},
journal = {J. Comb. Optim.},
volume = {40},
number = {4},
pages = {1008--1019},
year = {2020},
url = {https://doi.org/10.1007/s10878-020-00644-7},
doi = {10.1007/S10878-020-00644-7},
timestamp = {Thu, 14 Oct 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jco/GuoBLZ20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgt/LiBZ20,
author = {Ruonan Li and
Hajo Broersma and
Shenggui Zhang},
title = {Vertex-disjoint properly edge-colored cycles in edge-colored complete
graphs},
journal = {J. Graph Theory},
volume = {94},
number = {3},
pages = {476--493},
year = {2020},
url = {https://doi.org/10.1002/jgt.22536},
doi = {10.1002/JGT.22536},
timestamp = {Fri, 14 May 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jgt/LiBZ20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/nature/ChenGVAWEBBZW20,
author = {Tao Chen and
Jeroen van Gelder and
Bram van de Ven and
Sergey V. Amitonov and
Bram De Wilde and
Hans{-}Christian Ruiz Euler and
Hajo Broersma and
Peter A. Bobbert and
Floris A. Zwanenburg and
Wilfred G. van der Wiel},
title = {Classification with a disordered dopant-atom network in silicon},
journal = {Nat.},
volume = {577},
number = {7790},
pages = {341--345},
year = {2020},
url = {https://doi.org/10.1038/s41586-019-1901-0},
doi = {10.1038/S41586-019-1901-0},
timestamp = {Tue, 16 Nov 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/nature/ChenGVAWEBBZW20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/pdcat/LiYBZ20,
author = {Fengwei Li and
Qingfang Ye and
Hajo Broersma and
Xiaoyan Zhang},
editor = {Yong Zhang and
Yicheng Xu and
Hui Tian},
title = {Optimal Algorithm of Isolated Toughness for Interval Graphs},
booktitle = {Parallel and Distributed Computing, Applications and Technologies
- 21st International Conference, {PDCAT} 2020, Shenzhen, China, December
28-30, 2020, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {12606},
pages = {379--388},
publisher = {Springer},
year = {2020},
url = {https://doi.org/10.1007/978-3-030-69244-5\_34},
doi = {10.1007/978-3-030-69244-5\_34},
timestamp = {Mon, 03 Jan 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/pdcat/LiYBZ20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2007-12371,
author = {Hans{-}Christian Ruiz Euler and
Unai Alegre Ibarra and
Bram van de Ven and
Hajo Broersma and
Peter A. Bobbert and
Wilfred G. van der Wiel},
title = {Dopant Network Processing Units: Towards Efficient Neural-network
Emulators with High-capacity Nanoelectronic Nodes},
journal = {CoRR},
volume = {abs/2007.12371},
year = {2020},
url = {https://arxiv.org/abs/2007.12371},
eprinttype = {arXiv},
eprint = {2007.12371},
timestamp = {Sat, 23 Jan 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-2007-12371.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/BoodeB19,
author = {Antoon Hendrik Boode and
Hajo Broersma},
title = {Decompositions of graphs based on a new graph product},
journal = {Discret. Appl. Math.},
volume = {259},
pages = {31--40},
year = {2019},
url = {https://doi.org/10.1016/j.dam.2018.12.014},
doi = {10.1016/J.DAM.2018.12.014},
timestamp = {Mon, 29 Aug 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/dam/BoodeB19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/LiZB19,
author = {Fengwei Li and
Xiaoyan Zhang and
Hajo Broersma},
title = {A polynomial algorithm for weighted scattering number in interval
graphs},
journal = {Discret. Appl. Math.},
volume = {264},
pages = {118--124},
year = {2019},
url = {https://doi.org/10.1016/j.dam.2019.01.004},
doi = {10.1016/J.DAM.2019.01.004},
timestamp = {Thu, 15 Jul 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/dam/LiZB19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/gc/LiBZ19,
author = {Ruonan Li and
Hajo Broersma and
Shenggui Zhang},
title = {Properly Edge-colored Theta Graphs in Edge-colored Complete Graphs},
journal = {Graphs Comb.},
volume = {35},
number = {1},
pages = {261--286},
year = {2019},
url = {https://doi.org/10.1007/s00373-018-1989-2},
doi = {10.1007/S00373-018-1989-2},
timestamp = {Sat, 05 Sep 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/gc/LiBZ19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/amc/LiBRS18,
author = {Fengwei Li and
Hajo Broersma and
Juan Rada and
Yuefang Sun},
title = {Extremal benzenoid systems for two modified versions of the Randi{\'{c}}
index},
journal = {Appl. Math. Comput.},
volume = {337},
pages = {14--24},
year = {2018},
url = {https://doi.org/10.1016/j.amc.2018.05.021},
doi = {10.1016/J.AMC.2018.05.021},
timestamp = {Thu, 14 Oct 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/amc/LiBRS18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dm/LiBZ18,
author = {Binlong Li and
Hajo Broersma and
Shenggui Zhang},
title = {Conditions for graphs to be path partition optimal},
journal = {Discret. Math.},
volume = {341},
number = {5},
pages = {1350--1358},
year = {2018},
url = {https://doi.org/10.1016/j.disc.2018.02.011},
doi = {10.1016/J.DISC.2018.02.011},
timestamp = {Sat, 05 Sep 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/dm/LiBZ18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@incollection{DBLP:series/ncs/KonkoliSBDNN18,
author = {Zoran Konkoli and
Susan Stepney and
Hajo Broersma and
Paolo Dini and
Chrystopher L. Nehaniv and
Stefano Nichele},
editor = {Susan Stepney and
Steen Rasmussen and
Martyn Amos},
title = {Philosophy of Computation},
booktitle = {Computational Matter},
series = {Natural Computing Series},
pages = {153--184},
publisher = {Springer},
year = {2018},
url = {https://doi.org/10.1007/978-3-319-65826-1\_10},
doi = {10.1007/978-3-319-65826-1\_10},
timestamp = {Tue, 16 Aug 2022 23:09:56 +0200},
biburl = {https://dblp.org/rec/series/ncs/KonkoliSBDNN18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@incollection{DBLP:series/ncs/BroersmaSW18,
author = {Hajo Broersma and
Susan Stepney and
G{\"{o}}ran Wendin},
editor = {Susan Stepney and
Steen Rasmussen and
Martyn Amos},
title = {Computability and Complexity of Unconventional Computing Devices},
booktitle = {Computational Matter},
series = {Natural Computing Series},
pages = {185--229},
publisher = {Springer},
year = {2018},
url = {https://doi.org/10.1007/978-3-319-65826-1\_11},
doi = {10.1007/978-3-319-65826-1\_11},
timestamp = {Thu, 23 Jun 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/series/ncs/BroersmaSW18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dm/LiBXZ17,
author = {Ruonan Li and
Hajo Broersma and
Chuandong Xu and
Shenggui Zhang},
title = {Cycle extension in edge-colored complete graphs},
journal = {Discret. Math.},
volume = {340},
number = {6},
pages = {1235--1241},
year = {2017},
url = {https://doi.org/10.1016/j.disc.2017.01.023},
doi = {10.1016/J.DISC.2017.01.023},
timestamp = {Sat, 05 Sep 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/dm/LiBXZ17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/gc/LiZB17,
author = {Binlong Li and
Yanbo Zhang and
Hajo Broersma},
title = {An Exact Formula for all Star-Kipas Ramsey Numbers},
journal = {Graphs Comb.},
volume = {33},
number = {1},
pages = {141--148},
year = {2017},
url = {https://doi.org/10.1007/s00373-016-1746-3},
doi = {10.1007/S00373-016-1746-3},
timestamp = {Thu, 14 Oct 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/gc/LiZB17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamdm/ZhangZBL17,
author = {Zan{-}Bo Zhang and
Xiaoyan Zhang and
Hajo Broersma and
Dingjun Lou},
title = {Extremal and Degree Conditions for Path Extendability in Digraphs},
journal = {{SIAM} J. Discret. Math.},
volume = {31},
number = {3},
pages = {1990--2014},
year = {2017},
url = {https://doi.org/10.1137/16M1077453},
doi = {10.1137/16M1077453},
timestamp = {Wed, 14 Jul 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamdm/ZhangZBL17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/BroersmaSW17,
author = {Hajo Broersma and
Susan Stepney and
G{\"{o}}ran Wendin},
title = {Computability and Complexity of Unconventional Computing Devices},
journal = {CoRR},
volume = {abs/1702.02980},
year = {2017},
url = {http://arxiv.org/abs/1702.02980},
eprinttype = {arXiv},
eprint = {1702.02980},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/BroersmaSW17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/arscom/ChenLLB16,
author = {Xiaodong Chen and
Mingchu Li and
Wei Liao and
Hajo Broersma},
title = {Hamiltonian properties of almost locally connected claw-free graphs},
journal = {Ars Comb.},
volume = {124},
pages = {95--109},
year = {2016},
timestamp = {Tue, 02 Aug 2016 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/arscom/ChenLLB16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/ZhangBC16,
author = {Yanbo Zhang and
Hajo Broersma and
Yaojun Chen},
title = {On star-critical and upper size Ramsey numbers},
journal = {Discret. Appl. Math.},
volume = {202},
pages = {174--180},
year = {2016},
url = {https://doi.org/10.1016/j.dam.2015.08.020},
doi = {10.1016/J.DAM.2015.08.020},
timestamp = {Thu, 14 Oct 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/dam/ZhangBC16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dm/ZhangBC16,
author = {Yanbo Zhang and
Hajo Broersma and
Yaojun Chen},
title = {On fan-wheel and tree-wheel Ramsey numbers},
journal = {Discret. Math.},
volume = {339},
number = {9},
pages = {2284--2287},
year = {2016},
url = {https://doi.org/10.1016/j.disc.2016.03.013},
doi = {10.1016/J.DISC.2016.03.013},
timestamp = {Thu, 14 Oct 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/dm/ZhangBC16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dmgt/BroersmaLZ16,
author = {Hajo Broersma and
Binlong Li and
Shenggui Zhang},
title = {Forbidden subgraphs for hamiltonicity of 1-tough graphs},
journal = {Discuss. Math. Graph Theory},
volume = {36},
number = {4},
pages = {915--929},
year = {2016},
url = {https://doi.org/10.7151/dmgt.1897},
doi = {10.7151/DMGT.1897},
timestamp = {Sat, 05 Sep 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/dmgt/BroersmaLZ16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dmtcs/ZhangZBW16,
author = {Xiaoyan Zhang and
Zan{-}Bo Zhang and
Hajo Broersma and
Xuelian Wen},
title = {On the complexity of edge-colored subgraph partitioning problems in
network optimization},
journal = {Discret. Math. Theor. Comput. Sci.},
volume = {17},
number = {3},
pages = {227--244},
year = {2016},
url = {https://doi.org/10.46298/dmtcs.2159},
doi = {10.46298/DMTCS.2159},
timestamp = {Tue, 31 Jan 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dmtcs/ZhangZBW16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/cec/DammeBMLW16,
author = {Ruud van Damme and
Hajo Broersma and
Julia Mikhal and
Celestine Lawrence and
Wilfred G. van der Wiel},
title = {A simulation tool for evolving functionalities in disordered nanoparticle
networks},
booktitle = {{IEEE} Congress on Evolutionary Computation, {CEC} 2016, Vancouver,
BC, Canada, July 24-29, 2016},
pages = {5238--5245},
publisher = {{IEEE}},
year = {2016},
url = {https://doi.org/10.1109/CEC.2016.7748354},
doi = {10.1109/CEC.2016.7748354},
timestamp = {Tue, 16 Nov 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/cec/DammeBMLW16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/combinatorics/LiZBBH15,
author = {Binlong Li and
Yanbo Zhang and
Halina Bielak and
Hajo Broersma and
Premek Holub},
title = {Closing the Gap on Path-Kipas Ramsey Numbers},
journal = {Electron. J. Comb.},
volume = {22},
number = {3},
pages = {3},
year = {2015},
url = {https://doi.org/10.37236/5007},
doi = {10.37236/5007},
timestamp = {Thu, 23 Jun 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/combinatorics/LiZBBH15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dm/ZhangBC15,
author = {Yanbo Zhang and
Hajo Broersma and
Yaojun Chen},
title = {Ramsey numbers of trees versus fans},
journal = {Discret. Math.},
volume = {338},
number = {6},
pages = {994--999},
year = {2015},
url = {https://doi.org/10.1016/j.disc.2015.01.030},
doi = {10.1016/J.DISC.2015.01.030},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dm/ZhangBC15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eatcs/Broersma15,
author = {Hajo Broersma},
title = {How tough is toughness?},
journal = {Bull. {EATCS}},
volume = {117},
year = {2015},
url = {http://eatcs.org/beatcs/index.php/beatcs/article/view/362},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/eatcs/Broersma15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ejgta/BoodeBB15,
author = {Antoon Hendrik Boode and
Hajo Broersma and
Jan F. Broenink},
title = {On a directed tree problem motivated by a newly introduced graph product},
journal = {Electron. J. Graph Theory Appl.},
volume = {3},
number = {2},
pages = {162--181},
year = {2015},
url = {https://doi.org/10.5614/ejgta.2015.3.2.5},
doi = {10.5614/EJGTA.2015.3.2.5},
timestamp = {Mon, 29 Aug 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ejgta/BoodeBB15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/gc/BauerBHKNSWY15,
author = {Douglas Bauer and
Hajo Broersma and
Jan van den Heuvel and
Nathan Kahl and
Aori Nevo and
Edward F. Schmeichel and
Douglas R. Woodall and
Michael Yatauro},
title = {Best Monotone Degree Conditions for Graph Properties: {A} Survey},
journal = {Graphs Comb.},
volume = {31},
number = {1},
pages = {1--22},
year = {2015},
url = {https://doi.org/10.1007/s00373-014-1465-6},
doi = {10.1007/S00373-014-1465-6},
timestamp = {Fri, 11 Jun 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/gc/BauerBHKNSWY15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/gc/LiNBZ15,
author = {Binlong Li and
Bo Ning and
Hajo Broersma and
Shenggui Zhang},
title = {Characterizing Heavy Subgraph Pairs for Pancyclicity},
journal = {Graphs Comb.},
volume = {31},
number = {3},
pages = {649--667},
year = {2015},
url = {https://doi.org/10.1007/s00373-014-1406-4},
doi = {10.1007/S00373-014-1406-4},
timestamp = {Sat, 05 Sep 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/gc/LiNBZ15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/gc/ZhangBC15,
author = {Yanbo Zhang and
Hajo Broersma and
Yaojun Chen},
title = {Three Results on Cycle-Wheel Ramsey Numbers},
journal = {Graphs Comb.},
volume = {31},
number = {6},
pages = {2467--2479},
year = {2015},
url = {https://doi.org/10.1007/s00373-014-1523-0},
doi = {10.1007/S00373-014-1523-0},
timestamp = {Thu, 14 Oct 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/gc/ZhangBC15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgt/BroersmaFGKPP15,
author = {Hajo Broersma and
Jir{\'{\i}} Fiala and
Petr A. Golovach and
Tom{\'{a}}s Kaiser and
Dani{\"{e}}l Paulusma and
Andrzej Proskurowski},
title = {Linear-Time Algorithms for Scattering Number and Hamilton-Connectivity
of Interval Graphs},
journal = {J. Graph Theory},
volume = {79},
number = {4},
pages = {282--299},
year = {2015},
url = {https://doi.org/10.1002/jgt.21832},
doi = {10.1002/JGT.21832},
timestamp = {Mon, 26 Oct 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jgt/BroersmaFGKPP15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/WangZZB15,
author = {Limin Wang and
Xiaoyan Zhang and
Zhao Zhang and
Hajo Broersma},
title = {A {PTAS} for the minimum weight connected vertex cover {P3} problem
on unit disk graphs},
journal = {Theor. Comput. Sci.},
volume = {571},
pages = {58--66},
year = {2015},
url = {https://doi.org/10.1016/j.tcs.2015.01.005},
doi = {10.1016/J.TCS.2015.01.005},
timestamp = {Thu, 09 Jun 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/tcs/WangZZB15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/gecco/MillerB15,
author = {Julian Francis Miller and
Hajo Broersma},
editor = {Sara Silva and
Anna Isabel Esparcia{-}Alc{\'{a}}zar},
title = {Computational Matter: Evolving Computational Solutions in Materials},
booktitle = {Genetic and Evolutionary Computation Conference, {GECCO} 2015, Madrid,
Spain, July 11-15, 2015, Companion Material Proceedings},
pages = {769--770},
publisher = {{ACM}},
year = {2015},
url = {https://doi.org/10.1145/2739482.2764939},
doi = {10.1145/2739482.2764939},
timestamp = {Sat, 05 Sep 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/gecco/MillerB15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dmgt/BroersmaLZ14,
author = {Hajo Broersma and
Binlong Li and
Shenggui Zhang},
title = {Heavy subgraph pairs for traceability of block-chains},
journal = {Discuss. Math. Graph Theory},
volume = {34},
number = {2},
pages = {287--307},
year = {2014},
url = {https://doi.org/10.7151/dmgt.1737},
doi = {10.7151/DMGT.1737},
timestamp = {Sat, 05 Sep 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/dmgt/BroersmaLZ14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ejgta/ZhangBC14,
author = {Yanbo Zhang and
Hajo Broersma and
Yaojun Chen},
title = {A remark on star-C4 and wheel-C4 Ramsey numbers},
journal = {Electron. J. Graph Theory Appl.},
volume = {2},
number = {2},
pages = {110--114},
year = {2014},
url = {https://doi.org/10.5614/ejgta.2014.2.2.3},
doi = {10.5614/EJGTA.2014.2.2.3},
timestamp = {Thu, 14 Oct 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ejgta/ZhangBC14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/gc/WuBK14,
author = {Jichang Wu and
Hajo Broersma and
Haiyan Kang},
title = {Removable Edges and Chords of Longest Cycles in 3-Connected Graphs},
journal = {Graphs Comb.},
volume = {30},
number = {3},
pages = {743--753},
year = {2014},
url = {https://doi.org/10.1007/s00373-013-1296-x},
doi = {10.1007/S00373-013-1296-X},
timestamp = {Sat, 05 Sep 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/gc/WuBK14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgt/BroersmaPP14,
author = {Hajo Broersma and
Viresh Patel and
Artem V. Pyatkin},
title = {On Toughness and Hamiltonicity of 2\emph{K}\({}_{\mbox{2}}\)-Free
Graphs},
journal = {J. Graph Theory},
volume = {75},
number = {3},
pages = {244--255},
year = {2014},
url = {https://doi.org/10.1002/jgt.21734},
doi = {10.1002/JGT.21734},
timestamp = {Fri, 02 Oct 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jgt/BroersmaPP14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/BroersmaFHP13,
author = {Hajo Broersma and
Fedor V. Fomin and
Pim van 't Hof and
Dani{\"{e}}l Paulusma},
title = {Exact Algorithms for Finding Longest Cycles in Claw-Free Graphs},
journal = {Algorithmica},
volume = {65},
number = {1},
pages = {129--145},
year = {2013},
url = {https://doi.org/10.1007/s00453-011-9576-4},
doi = {10.1007/S00453-011-9576-4},
timestamp = {Thu, 14 Oct 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/BroersmaFHP13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ejc/BroersmaKW13,
author = {Hajo Broersma and
Dieter Kratsch and
Gerhard J. Woeginger},
title = {Fully decomposable split graphs},
journal = {Eur. J. Comb.},
volume = {34},
number = {3},
pages = {567--575},
year = {2013},
url = {https://doi.org/10.1016/j.ejc.2011.09.044},
doi = {10.1016/J.EJC.2011.09.044},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ejc/BroersmaKW13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ejc/BroersmaFGP13,
author = {Hajo Broersma and
Fedor V. Fomin and
Petr A. Golovach and
Dani{\"{e}}l Paulusma},
title = {Three complexity results on coloring Pk-free graphs},
journal = {Eur. J. Comb.},
volume = {34},
number = {3},
pages = {609--619},
year = {2013},
url = {https://doi.org/10.1016/j.ejc.2011.12.008},
doi = {10.1016/J.EJC.2011.12.008},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ejc/BroersmaFGP13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ejgta/LiBZ13,
author = {Binlong Li and
Hajo Broersma and
Shenggui Zhang},
title = {Forbidden subgraph pairs for traceability of block-chains},
journal = {Electron. J. Graph Theory Appl.},
volume = {1},
number = {1},
pages = {1--10},
year = {2013},
url = {https://doi.org/10.5614/ejgta.2013.1.1.1},
doi = {10.5614/EJGTA.2013.1.1.1},
timestamp = {Thu, 14 Oct 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ejgta/LiBZ13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/gc/LiYJLB13,
author = {Mingchu Li and
Lifeng Yuan and
He Jiang and
Bing Liu and
Haitze J. Broersma},
title = {Tank-Ring Factors in Supereulerian Claw-Free Graphs},
journal = {Graphs Comb.},
volume = {29},
number = {3},
pages = {599--608},
year = {2013},
url = {https://doi.org/10.1007/s00373-011-1117-z},
doi = {10.1007/S00373-011-1117-Z},
timestamp = {Thu, 03 Aug 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/gc/LiYJLB13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgt/BauerBHKS13,
author = {Douglas Bauer and
Haitze J. Broersma and
Jan van den Heuvel and
Nathan Kahl and
Edward F. Schmeichel},
title = {Toughness and Vertex Degrees},
journal = {J. Graph Theory},
volume = {72},
number = {2},
pages = {209--219},
year = {2013},
url = {https://doi.org/10.1002/jgt.21639},
doi = {10.1002/JGT.21639},
timestamp = {Fri, 02 Oct 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jgt/BauerBHKS13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/BroersmaGP13,
author = {Hajo Broersma and
Petr A. Golovach and
Viresh Patel},
title = {Tight complexity bounds for {FPT} subgraph problems parameterized
by the clique-width},
journal = {Theor. Comput. Sci.},
volume = {485},
pages = {69--84},
year = {2013},
url = {https://doi.org/10.1016/j.tcs.2013.03.008},
doi = {10.1016/J.TCS.2013.03.008},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/BroersmaGP13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/memocode/GrooteHKB13,
author = {Robert de Groote and
Philip K. F. H{\"{o}}lzenspies and
Jan Kuper and
Hajo Broersma},
title = {Back to basics: Homogeneous representations of multi-rate synchronous
dataflow graphs},
booktitle = {11th {ACM/IEEE} International Conference on Formal Methods and Models
for Codesign, {MEMCODE} 2013, Portland, OR, USA, October 18-20, 2013},
pages = {35--46},
publisher = {{IEEE}},
year = {2013},
url = {https://ieeexplore.ieee.org/document/6670939/},
timestamp = {Wed, 11 Aug 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/memocode/GrooteHKB13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/wg/BroersmaFGKPP13,
author = {Hajo Broersma and
Jir{\'{\i}} Fiala and
Petr A. Golovach and
Tom{\'{a}}s Kaiser and
Dani{\"{e}}l Paulusma and
Andrzej Proskurowski},
editor = {Andreas Brandst{\"{a}}dt and
Klaus Jansen and
R{\"{u}}diger Reischuk},
title = {Linear-Time Algorithms for Scattering Number and Hamilton-Connectivity
of Interval Graphs},
booktitle = {Graph-Theoretic Concepts in Computer Science - 39th International
Workshop, {WG} 2013, L{\"{u}}beck, Germany, June 19-21, 2013,
Revised Papers},
series = {Lecture Notes in Computer Science},
volume = {8165},
pages = {127--138},
publisher = {Springer},
year = {2013},
url = {https://doi.org/10.1007/978-3-642-45043-3\_12},
doi = {10.1007/978-3-642-45043-3\_12},
timestamp = {Sat, 05 Sep 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/wg/BroersmaFGKPP13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/wotug/BoodeBB13,
author = {Antoon Hendrik Boode and
Hajo Broersma and
Jan F. Broenink},
editor = {Peter H. Welch and
Frederick R. M. Barnes and
Jan F. Broenink and
Kevin Chalmers and
Jan B{\ae}kgaard Pedersen and
Adam T. Sampson},
title = {Improving the Performance of Periodic Real-time Processes: a Graph
Theoretical Approach},
booktitle = {35th Communicating Process Architectures, {CPA} 2013, organised under
the auspices of WoTUG, Edinburgh, Scotland, UK, August 25, 2013},
pages = {57--80},
publisher = {Open Channel Publishing Ltd.},
year = {2013},
url = {http://wotug.org/paperdb/show\_pap.php?f=1\&\#38;num=685},
timestamp = {Mon, 29 Aug 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/wotug/BoodeBB13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1301-5953,
author = {Hajo Broersma and
Jir{\'{\i}} Fiala and
Petr A. Golovach and
Tom{\'{a}}s Kaiser and
Dani{\"{e}}l Paulusma and
Andrzej Proskurowski},
title = {Linear-Time Algorithms for Scattering Number and Hamilton-Connectivity
of Interval Graphs},
journal = {CoRR},
volume = {abs/1301.5953},
year = {2013},
url = {http://arxiv.org/abs/1301.5953},
eprinttype = {arXiv},
eprint = {1301.5953},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1301-5953.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dm/LiBZ12,
author = {Binlong Li and
Hajo Broersma and
Shenggui Zhang},
title = {Pairs of forbidden induced subgraphs for homogeneously traceable graphs},
journal = {Discret. Math.},
volume = {312},
number = {18},
pages = {2800--2818},
year = {2012},
url = {https://doi.org/10.1016/j.disc.2012.05.018},
doi = {10.1016/J.DISC.2012.05.018},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dm/LiBZ12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/gc/BroersmaRV12,
author = {Haitze J. Broersma and
Zdenek Ryj{\'{a}}cek and
Petr Vr{\'{a}}na},
title = {How Many Conjectures Can You Stand? {A} Survey},
journal = {Graphs Comb.},
volume = {28},
number = {1},
pages = {57--75},
year = {2012},
url = {https://doi.org/10.1007/s00373-011-1090-6},
doi = {10.1007/S00373-011-1090-6},
timestamp = {Sat, 05 Sep 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/gc/BroersmaRV12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/gc/BauerBHKS12,
author = {Douglas Bauer and
Haitze J. Broersma and
Jan van den Heuvel and
Nathan Kahl and
Edward F. Schmeichel},
title = {Degree Sequences and the Existence of k-Factors},
journal = {Graphs Comb.},
volume = {28},
number = {2},
pages = {149--166},
year = {2012},
url = {https://doi.org/10.1007/s00373-011-1044-z},
doi = {10.1007/S00373-011-1044-Z},
timestamp = {Sat, 05 Sep 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/gc/BauerBHKS12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ijuc/BroersmaGMPT12,
author = {Hajo Broersma and
Faustino J. Gomez and
Julian F. Miller and
Mike Petty and
Gunnar Tufte},
title = {Nascence Project: Nanoscale Engineering for Novel Computation Using
Evolution},
journal = {Int. J. Unconv. Comput.},
volume = {8},
number = {4},
pages = {313--317},
year = {2012},
url = {http://www.oldcitypublishing.com/journals/ijuc-home/ijuc-issue-contents/ijuc-volume-8-number-4-2012/ijuc-8-4-p-313-317/},
timestamp = {Thu, 16 Apr 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ijuc/BroersmaGMPT12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jda/BonsmaBPP12,
author = {Paul S. Bonsma and
Hajo Broersma and
Viresh Patel and
Artem V. Pyatkin},
title = {The complexity of finding uniform sparsest cuts in various graph classes},
journal = {J. Discrete Algorithms},
volume = {14},
pages = {136--149},
year = {2012},
url = {https://doi.org/10.1016/j.jda.2011.12.008},
doi = {10.1016/J.JDA.2011.12.008},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jda/BonsmaBPP12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/BroersmaGPS12,
author = {Hajo Broersma and
Petr A. Golovach and
Dani{\"{e}}l Paulusma and
Jian Song},
title = {Updating the complexity status of coloring graphs without a fixed
induced linear forest},
journal = {Theor. Comput. Sci.},
volume = {414},
number = {1},
pages = {9--19},
year = {2012},
url = {https://doi.org/10.1016/j.tcs.2011.10.005},
doi = {10.1016/J.TCS.2011.10.005},
timestamp = {Wed, 24 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/BroersmaGPS12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/BroersmaGPS12a,
author = {Hajo Broersma and
Petr A. Golovach and
Dani{\"{e}}l Paulusma and
Jian Song},
title = {Determining the chromatic number of triangle-free 2P\({}_{\mbox{3}}\)-free
graphs in polynomial time},
journal = {Theor. Comput. Sci.},
volume = {423},
pages = {1--10},
year = {2012},
url = {https://doi.org/10.1016/j.tcs.2011.12.076},
doi = {10.1016/J.TCS.2011.12.076},
timestamp = {Wed, 24 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/BroersmaGPS12a.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/euromicro/GrooteKBS12,
author = {Robert de Groote and
Jan Kuper and
Hajo Broersma and
Gerard J. M. Smit},
editor = {Vittorio Cortellessa and
Henry Muccini and
Onur Demir{\"{o}}rs},
title = {Max-Plus Algebraic Throughput Analysis of Synchronous Dataflow Graphs},
booktitle = {38th Euromicro Conference on Software Engineering and Advanced Applications,
{SEAA} 2012, Cesme, Izmir, Turkey, September 5-8, 2012},
pages = {29--38},
publisher = {{IEEE} Computer Society},
year = {2012},
url = {https://doi.org/10.1109/SEAA.2012.20},
doi = {10.1109/SEAA.2012.20},
timestamp = {Fri, 24 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/euromicro/GrooteKBS12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgt/LiCB11,
author = {Mingchu Li and
Xiaodong Chen and
Hajo Broersma},
title = {Hamiltonian connectedness in 4-connected hourglass-free claw-free
graphs},
journal = {J. Graph Theory},
volume = {68},
number = {4},
pages = {285--298},
year = {2011},
url = {https://doi.org/10.1002/jgt.20558},
doi = {10.1002/JGT.20558},
timestamp = {Fri, 02 Oct 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jgt/LiCB11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/iwpec/BroersmaGP11,
author = {Hajo Broersma and
Petr A. Golovach and
Viresh Patel},
editor = {D{\'{a}}niel Marx and
Peter Rossmanith},
title = {Tight Complexity Bounds for {FPT} Subgraph Problems Parameterized
by Clique-Width},
booktitle = {Parameterized and Exact Computation - 6th International Symposium,
{IPEC} 2011, Saarbr{\"{u}}cken, Germany, September 6-8, 2011.
Revised Selected Papers},
series = {Lecture Notes in Computer Science},
volume = {7112},
pages = {207--218},
publisher = {Springer},
year = {2011},
url = {https://doi.org/10.1007/978-3-642-28050-4\_17},
doi = {10.1007/978-3-642-28050-4\_17},
timestamp = {Fri, 09 Apr 2021 18:49:30 +0200},
biburl = {https://dblp.org/rec/conf/iwpec/BroersmaGP11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jda/BroersmaDJS10,
author = {Hajo Broersma and
Stefan S. Dantchev and
Matthew Johnson and
Stefan Szeider},
title = {Editorial},
journal = {J. Discrete Algorithms},
volume = {8},
number = {2},
pages = {101},
year = {2010},
url = {https://doi.org/10.1016/j.jda.2009.07.003},
doi = {10.1016/J.JDA.2009.07.003},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jda/BroersmaDJS10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jda/BroersmaP10,
author = {Hajo Broersma and
Dani{\"{e}}l Paulusma},
title = {Computing sharp 2-factors in claw-free graphs},
journal = {J. Discrete Algorithms},
volume = {8},
number = {3},
pages = {321--329},
year = {2010},
url = {https://doi.org/10.1016/j.jda.2009.07.001},
doi = {10.1016/J.JDA.2009.07.001},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jda/BroersmaP10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/isaac/BroersmaGPS10,
author = {Hajo Broersma and
Petr A. Golovach and
Dani{\"{e}}l Paulusma and
Jian Song},
editor = {Otfried Cheong and
Kyung{-}Yong Chwa and
Kunsoo Park},
title = {On Coloring Graphs without Induced Forests},
booktitle = {Algorithms and Computation - 21st International Symposium, {ISAAC}
2010, Jeju Island, Korea, December 15-17, 2010, Proceedings, Part
{II}},
series = {Lecture Notes in Computer Science},
volume = {6507},
pages = {156--167},
publisher = {Springer},
year = {2010},
url = {https://doi.org/10.1007/978-3-642-17514-5\_14},
doi = {10.1007/978-3-642-17514-5\_14},
timestamp = {Tue, 21 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/isaac/BroersmaGPS10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/iwoca/BonsmaBPP10,
author = {Paul S. Bonsma and
Hajo Broersma and
Viresh Patel and
Artem V. Pyatkin},
editor = {Costas S. Iliopoulos and
William F. Smyth},
title = {The Complexity Status of Problems Related to Sparsest Cuts},
booktitle = {Combinatorial Algorithms - 21st International Workshop, {IWOCA} 2010,
London, UK, July 26-28, 2010, Revised Selected Papers},
series = {Lecture Notes in Computer Science},
volume = {6460},
pages = {125--135},
publisher = {Springer},
year = {2010},
url = {https://doi.org/10.1007/978-3-642-19222-7\_14},
doi = {10.1007/978-3-642-19222-7\_14},
timestamp = {Sat, 05 Sep 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/iwoca/BonsmaBPP10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/wg/BroersmaGPS10,
author = {Hajo Broersma and
Petr A. Golovach and
Dani{\"{e}}l Paulusma and
Jian Song},
editor = {Dimitrios M. Thilikos},
title = {Narrowing Down the Gap on the Complexity of Coloring \emph{P}\({}_{\mbox{\emph{k}}}\)-Free
Graphs},
booktitle = {Graph Theoretic Concepts in Computer Science - 36th International
Workshop, {WG} 2010, Zar{\'{o}}s, Crete, Greece, June 28-30,
2010 Revised Papers},
series = {Lecture Notes in Computer Science},
volume = {6410},
pages = {63--74},
year = {2010},
url = {https://doi.org/10.1007/978-3-642-16926-7\_8},
doi = {10.1007/978-3-642-16926-7\_8},
timestamp = {Tue, 21 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/wg/BroersmaGPS10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/appml/LiYZB09,
author = {Xueliang Li and
Xiangmei Yao and
Wenli Zhou and
Hajo Broersma},
title = {Complexity of conditional colorability of graphs},
journal = {Appl. Math. Lett.},
volume = {22},
number = {3},
pages = {320--324},
year = {2009},
url = {https://doi.org/10.1016/j.aml.2008.04.003},
doi = {10.1016/J.AML.2008.04.003},
timestamp = {Sat, 05 Sep 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/appml/LiYZB09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dm/BroersmaFMPSY09,
author = {Haitze J. Broersma and
Jun Fujisawa and
Bert Marchal and
Dani{\"{e}}l Paulusma and
A. N. M. Salman and
Kiyoshi Yoshimoto},
title = {lambda-backbone colorings along pairwise disjoint stars and matchings},
journal = {Discret. Math.},
volume = {309},
number = {18},
pages = {5596--5609},
year = {2009},
url = {https://doi.org/10.1016/j.disc.2008.04.007},
doi = {10.1016/J.DISC.2008.04.007},
timestamp = {Sat, 09 Apr 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/dm/BroersmaFMPSY09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dmgt/BroersmaMPS09,
author = {Hajo Broersma and
Bert Marchal and
Dani{\"{e}}l Paulusma and
A. N. M. Salman},
title = {Backbone colorings along stars and matchings in split graphs: their
span is close to the chromatic number},
journal = {Discuss. Math. Graph Theory},
volume = {29},
number = {1},
pages = {143--162},
year = {2009},
url = {https://doi.org/10.7151/dmgt.1437},
doi = {10.7151/DMGT.1437},
timestamp = {Sat, 09 Apr 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/dmgt/BroersmaMPS09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/gc/BroersmaPY09,
author = {Hajo Broersma and
Dani{\"{e}}l Paulusma and
Kiyoshi Yoshimoto},
title = {Sharp Upper Bounds on the Minimum Number of Components of 2-factors
in Claw-free Graphs},
journal = {Graphs Comb.},
volume = {25},
number = {4},
pages = {427--460},
year = {2009},
url = {https://doi.org/10.1007/s00373-009-0855-7},
doi = {10.1007/S00373-009-0855-7},
timestamp = {Mon, 26 Oct 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/gc/BroersmaPY09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jda/BroersmaDJS09,
author = {Hajo Broersma and
Stefan S. Dantchev and
Matthew Johnson and
Stefan Szeider},
title = {Editorial},
journal = {J. Discrete Algorithms},
volume = {7},
number = {2},
pages = {147},
year = {2009},
url = {https://doi.org/10.1016/j.jda.2008.09.002},
doi = {10.1016/J.JDA.2008.09.002},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jda/BroersmaDJS09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mmor/BroersmaV09,
author = {Hajo Broersma and
Elkin Vumar},
title = {On hamiltonicity of \emph{P} \({}_{\mbox{3}}\)-dominated graphs},
journal = {Math. Methods Oper. Res.},
volume = {69},
number = {2},
pages = {297--306},
year = {2009},
url = {https://doi.org/10.1007/s00186-008-0260-7},
doi = {10.1007/S00186-008-0260-7},
timestamp = {Sat, 05 Sep 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/mmor/BroersmaV09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/BroersmaJP09,
author = {Hajo Broersma and
Matthew Johnson and
Dani{\"{e}}l Paulusma},
title = {Upper bounds and algorithms for parallel knock-out numbers},
journal = {Theor. Comput. Sci.},
volume = {410},
number = {14},
pages = {1319--1327},
year = {2009},
url = {https://doi.org/10.1016/j.tcs.2008.03.024},
doi = {10.1016/J.TCS.2008.03.024},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/BroersmaJP09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/iwoca/BroersmaFGP09,
author = {Hajo Broersma and
Fedor V. Fomin and
Petr A. Golovach and
Dani{\"{e}}l Paulusma},
editor = {Jir{\'{\i}} Fiala and
Jan Kratochv{\'{\i}}l and
Mirka Miller},
title = {Three Complexity Results on Coloring \emph{P}\({}_{\mbox{\emph{k}}}\)-Free
Graphs},
booktitle = {Combinatorial Algorithms, 20th International Workshop, {IWOCA} 2009,
Hradec nad Moravic{\'{\i}}, Czech Republic, June 28-July 2, 2009,
Revised Selected Papers},
series = {Lecture Notes in Computer Science},
volume = {5874},
pages = {95--104},
publisher = {Springer},
year = {2009},
url = {https://doi.org/10.1007/978-3-642-10217-2\_12},
doi = {10.1007/978-3-642-10217-2\_12},
timestamp = {Sun, 25 Oct 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/iwoca/BroersmaFGP09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/iwoca/BroersmaKW09,
author = {Hajo Broersma and
Dieter Kratsch and
Gerhard J. Woeginger},
editor = {Jir{\'{\i}} Fiala and
Jan Kratochv{\'{\i}}l and
Mirka Miller},
title = {Fully Decomposable Split Graphs},
booktitle = {Combinatorial Algorithms, 20th International Workshop, {IWOCA} 2009,
Hradec nad Moravic{\'{\i}}, Czech Republic, June 28-July 2, 2009,
Revised Selected Papers},
series = {Lecture Notes in Computer Science},
volume = {5874},
pages = {105--112},
publisher = {Springer},
year = {2009},
url = {https://doi.org/10.1007/978-3-642-10217-2\_13},
doi = {10.1007/978-3-642-10217-2\_13},
timestamp = {Sat, 05 Sep 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/iwoca/BroersmaKW09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/wg/BroersmaFHP09,
author = {Hajo Broersma and
Fedor V. Fomin and
Pim van 't Hof and
Dani{\"{e}}l Paulusma},
editor = {Christophe Paul and
Michel Habib},
title = {Fast Exact Algorithms for Hamiltonicity in Claw-Free Graphs},
booktitle = {Graph-Theoretic Concepts in Computer Science, 35th International Workshop,
{WG} 2009, Montpellier, France, June 24-26, 2009. Revised Papers},
series = {Lecture Notes in Computer Science},
volume = {5911},
pages = {44--53},
year = {2009},
url = {https://doi.org/10.1007/978-3-642-11409-0\_4},
doi = {10.1007/978-3-642-11409-0\_4},
timestamp = {Thu, 14 Oct 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/wg/BroersmaFHP09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dm/LiXB08,
author = {Mingchu Li and
Liming Xiong and
Haitze J. Broersma},
title = {Connected even factors in claw-free graphs},
journal = {Discret. Math.},
volume = {308},
number = {11},
pages = {2282--2284},
year = {2008},
url = {https://doi.org/10.1016/j.disc.2007.04.058},
doi = {10.1016/J.DISC.2007.04.058},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dm/LiXB08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dm/BroersmaFKKRV08,
author = {Hajo Broersma and
Gasper Fijavz and
Tom{\'{a}}s Kaiser and
Roman Kuzel and
Zdenek Ryj{\'{a}}cek and
Petr Vr{\'{a}}na},
title = {Contractible subgraphs, Thomassen's conjecture and the dominating
cycle conjecture for snarks},
journal = {Discret. Math.},
volume = {308},
number = {24},
pages = {6064--6077},
year = {2008},
url = {https://doi.org/10.1016/j.disc.2007.11.026},
doi = {10.1016/J.DISC.2007.11.026},
timestamp = {Sat, 21 Oct 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/dm/BroersmaFKKRV08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dm/WangBHLS08,
author = {Ligong Wang and
Hajo Broersma and
Cornelis Hoede and
Xueliang Li and
Georg Still},
title = {Some families of integral graphs},
journal = {Discret. Math.},
volume = {308},
number = {24},
pages = {6383--6391},
year = {2008},
url = {https://doi.org/10.1016/j.disc.2007.12.010},
doi = {10.1016/J.DISC.2007.12.010},
timestamp = {Wed, 21 Apr 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/dm/WangBHLS08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jda/BroersmaDJS08,
author = {Hajo Broersma and
Stefan S. Dantchev and
Matthew Johnson and
Stefan Szeider},
title = {Preface},
journal = {J. Discrete Algorithms},
volume = {6},
number = {4},
pages = {539},
year = {2008},
url = {https://doi.org/10.1016/j.jda.2008.07.005},
doi = {10.1016/J.JDA.2008.07.005},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jda/BroersmaDJS08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamdm/BroersmaCP08,
author = {Hajo Broersma and
Agostino Capponi and
Dani{\"{e}}l Paulusma},
title = {A New Algorithm for On-line Coloring Bipartite Graphs},
journal = {{SIAM} J. Discret. Math.},
volume = {22},
number = {1},
pages = {72--91},
year = {2008},
url = {https://doi.org/10.1137/060668675},
doi = {10.1137/060668675},
timestamp = {Sat, 05 Sep 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamdm/BroersmaCP08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/BroersmaJPS08,
author = {Hajo Broersma and
Matthew Johnson and
Dani{\"{e}}l Paulusma and
Iain A. Stewart},
title = {The computational complexity of the parallel knock-out problem},
journal = {Theor. Comput. Sci.},
volume = {393},
number = {1-3},
pages = {182--195},
year = {2008},
url = {https://doi.org/10.1016/j.tcs.2007.11.021},
doi = {10.1016/J.TCS.2007.11.021},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/BroersmaJPS08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/mfcs/BroersmaP08,
author = {Hajo Broersma and
Dani{\"{e}}l Paulusma},
editor = {Edward Ochmanski and
Jerzy Tyszkiewicz},
title = {Computing Sharp 2-Factors in Claw-Free Graphs},
booktitle = {Mathematical Foundations of Computer Science 2008, 33rd International
Symposium, {MFCS} 2008, Torun, Poland, August 25-29, 2008, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {5162},
pages = {193--204},
publisher = {Springer},
year = {2008},
url = {https://doi.org/10.1007/978-3-540-85238-4\_15},
doi = {10.1007/978-3-540-85238-4\_15},
timestamp = {Sun, 25 Oct 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/mfcs/BroersmaP08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@proceedings{DBLP:conf/wg/2008,
editor = {Hajo Broersma and
Thomas Erlebach and
Tom Friedetzky and
Dani{\"{e}}l Paulusma},
title = {Graph-Theoretic Concepts in Computer Science, 34th International Workshop,
{WG} 2008, Durham, UK, June 30 - July 2, 2008. Revised Papers},
series = {Lecture Notes in Computer Science},
volume = {5344},
year = {2008},
url = {https://doi.org/10.1007/978-3-540-92248-3},
doi = {10.1007/978-3-540-92248-3},
isbn = {978-3-540-92247-6},
timestamp = {Sun, 25 Oct 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/wg/2008.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/BroersmaFKW07,
author = {Hajo Broersma and
Fedor V. Fomin and
Rastislav Kralovic and
Gerhard J. Woeginger},
title = {Eliminating graphs by means of parallel knock-out schemes},
journal = {Discret. Appl. Math.},
volume = {155},
number = {2},
pages = {92--102},
year = {2007},
url = {https://doi.org/10.1016/j.dam.2006.04.034},
doi = {10.1016/J.DAM.2006.04.034},
timestamp = {Thu, 11 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dam/BroersmaFKW07.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/WangBHLS07,
author = {Ligong Wang and
Hajo Broersma and
Cornelis Hoede and
Xueliang Li and
Georg Still},
title = {Integral trees of diameter 6},
journal = {Discret. Appl. Math.},
volume = {155},
number = {10},
pages = {1254--1266},
year = {2007},
url = {https://doi.org/10.1016/j.dam.2006.10.014},
doi = {10.1016/J.DAM.2006.10.014},
timestamp = {Wed, 21 Apr 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/dam/WangBHLS07.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/BauerBKMSS07,
author = {Douglas Bauer and
Hajo Broersma and
Nathan Kahl and
Aurora Morgana and
Edward F. Schmeichel and
Thomas M. Surowiec},
title = {Tutte sets in graphs {II:} The complexity of finding maximum Tutte
sets},
journal = {Discret. Appl. Math.},
volume = {155},
number = {10},
pages = {1336--1343},
year = {2007},
url = {https://doi.org/10.1016/j.dam.2007.02.002},
doi = {10.1016/J.DAM.2007.02.002},
timestamp = {Fri, 09 Apr 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/dam/BauerBKMSS07.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/SalmanB07,
author = {A. N. M. Salman and
Haitze J. Broersma},
title = {Path-kipas Ramsey numbers},
journal = {Discret. Appl. Math.},
volume = {155},
number = {14},
pages = {1878--1884},
year = {2007},
url = {https://doi.org/10.1016/j.dam.2006.05.013},
doi = {10.1016/J.DAM.2006.05.013},
timestamp = {Sat, 09 Apr 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/dam/SalmanB07.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dm/BroersmaXY07,
author = {Hajo Broersma and
Liming Xiong and
Kiyoshi Yoshimoto},
title = {Toughness and hamiltonicity in k-trees},
journal = {Discret. Math.},
volume = {307},
number = {7-8},
pages = {832--838},
year = {2007},
url = {https://doi.org/10.1016/j.disc.2005.11.051},
doi = {10.1016/J.DISC.2005.11.051},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dm/BroersmaXY07.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dm/SalmanB07,
author = {A. N. M. Salman and
Hajo Broersma},
title = {On Ramsey numbers for paths versus wheels},
journal = {Discret. Math.},
volume = {307},
number = {7-8},
pages = {975--982},
year = {2007},
url = {https://doi.org/10.1016/j.disc.2005.11.049},
doi = {10.1016/J.DISC.2005.11.049},
timestamp = {Sat, 09 Apr 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/dm/SalmanB07.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/endm/BroersmaFKKRV07,
author = {Hajo Broersma and
Gasper Fijavz and
Tom{\'{a}}s Kaiser and
Roman Kuzel and
Zdenek Ryj{\'{a}}cek and
Petr Vr{\'{a}}na},
title = {Contractible Subgraphs, Thomassen's Conjecture and the Dominating
Cycle Conjecture for Snarks},
journal = {Electron. Notes Discret. Math.},
volume = {28},
pages = {55--59},
year = {2007},
url = {https://doi.org/10.1016/j.endm.2007.01.009},
doi = {10.1016/J.ENDM.2007.01.009},
timestamp = {Sat, 05 Sep 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/endm/BroersmaFKKRV07.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/endm/BroersmaPY07,
author = {Hajo Broersma and
Dani{\"{e}}l Paulusma and
Kiyoshi Yoshimoto},
title = {On components of 2-factors in claw-free graphs},
journal = {Electron. Notes Discret. Math.},
volume = {29},
pages = {289--293},
year = {2007},
url = {https://doi.org/10.1016/j.endm.2007.07.050},
doi = {10.1016/J.ENDM.2007.07.050},
timestamp = {Sat, 05 Sep 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/endm/BroersmaPY07.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgt/BorodinBGH07,
author = {Oleg V. Borodin and
Hajo Broersma and
Alexei N. Glebov and
Jan van den Heuvel},
title = {A new upper bound on the cyclic chromatic number},
journal = {J. Graph Theory},
volume = {54},
number = {1},
pages = {58--72},
year = {2007},
url = {https://doi.org/10.1002/jgt.20193},
doi = {10.1002/JGT.20193},
timestamp = {Fri, 02 Oct 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jgt/BorodinBGH07.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgt/BroersmaFGW07,
author = {Hajo Broersma and
Fedor V. Fomin and
Petr A. Golovach and
Gerhard J. Woeginger},
title = {Backbone colorings for graphs: Tree and path backbones},
journal = {J. Graph Theory},
volume = {55},
number = {2},
pages = {137--152},
year = {2007},
url = {https://doi.org/10.1002/jgt.20228},
doi = {10.1002/JGT.20228},
timestamp = {Fri, 02 Oct 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jgt/BroersmaFGW07.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgt/BauerBMS07,
author = {Douglas Bauer and
Hajo Broersma and
Aurora Morgana and
Edward F. Schmeichel},
title = {Tutte sets in graphs {I:} Maximal tutte sets and D-graphs},
journal = {J. Graph Theory},
volume = {55},
number = {4},
pages = {343--358},
year = {2007},
url = {https://doi.org/10.1002/jgt.20243},
doi = {10.1002/JGT.20243},
timestamp = {Fri, 02 Oct 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jgt/BauerBMS07.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/BroersmaL07,
author = {Hajo Broersma and
Xueliang Li},
title = {On the complexity of dominating set problems related to the minimum
all-ones problem},
journal = {Theor. Comput. Sci.},
volume = {385},
number = {1-3},
pages = {60--70},
year = {2007},
url = {https://doi.org/10.1016/j.tcs.2007.05.027},
doi = {10.1016/J.TCS.2007.05.027},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/BroersmaL07.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/sirocco/BroersmaJP07,
author = {Hajo Broersma and
Matthew Johnson and
Dani{\"{e}}l Paulusma},
editor = {Giuseppe Prencipe and
Shmuel Zaks},
title = {Upper Bounds and Algorithms for Parallel Knock-Out Numbers},
booktitle = {Structural Information and Communication Complexity, 14th International
Colloquium, {SIROCCO} 2007, Castiglioncello, Italy, June 5-8, 2007,
Proceedings},
series = {Lecture Notes in Computer Science},
volume = {4474},
pages = {328--340},
publisher = {Springer},
year = {2007},
url = {https://doi.org/10.1007/978-3-540-72951-8\_26},
doi = {10.1007/978-3-540-72951-8\_26},
timestamp = {Sat, 05 Sep 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/sirocco/BroersmaJP07.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/sofsem/BroersmaMPS07,
author = {Hajo Broersma and
Bert Marchal and
Dani{\"{e}}l Paulusma and
A. N. M. Salman},
editor = {Jan van Leeuwen and
Giuseppe F. Italiano and
Wiebe van der Hoek and
Christoph Meinel and
Harald Sack and
Frantisek Pl{\'{a}}sil},
title = {Improved Upper Bounds for \emph{lambda} -Backbone Colorings Along
Matchings and Stars},
booktitle = {{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},
series = {Lecture Notes in Computer Science},
volume = {4362},
pages = {188--199},
publisher = {Springer},
year = {2007},
url = {https://doi.org/10.1007/978-3-540-69507-3\_15},
doi = {10.1007/978-3-540-69507-3\_15},
timestamp = {Fri, 21 Oct 2022 16:47:28 +0200},
biburl = {https://dblp.org/rec/conf/sofsem/BroersmaMPS07.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/BroersmaFKW06,
author = {Hajo Broersma and
Fedor V. Fomin and
Jan Kratochv{\'{\i}}l and
Gerhard J. Woeginger},
title = {Planar Graph Coloring Avoiding Monochromatic Subgraphs: Trees and
Paths Make It Difficult},
journal = {Algorithmica},
volume = {44},
number = {4},
pages = {343--361},
year = {2006},
url = {https://doi.org/10.1007/s00453-005-1176-8},
doi = {10.1007/S00453-005-1176-8},
timestamp = {Sat, 05 Sep 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/BroersmaFKW06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/combinatorica/BrandtBDK06,
author = {Stephan Brandt and
Hajo Broersma and
Reinhard Diestel and
Matthias Kriesell},
title = {Global Connectivity And Expansion: Long Cycles and Factors In \emph{f}-Connected
Graphs},
journal = {Comb.},
volume = {26},
number = {1},
pages = {17--36},
year = {2006},
url = {https://doi.org/10.1007/s00493-006-0002-5},
doi = {10.1007/S00493-006-0002-5},
timestamp = {Sat, 05 Sep 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/combinatorica/BrandtBDK06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/SalmanB06,
author = {A. N. M. Salman and
Hajo Broersma},
title = {Path-fan Ramsey numbers},
journal = {Discret. Appl. Math.},
volume = {154},
number = {9},
pages = {1429--1436},
year = {2006},
url = {https://doi.org/10.1016/j.dam.2005.05.040},
doi = {10.1016/J.DAM.2005.05.040},
timestamp = {Sat, 09 Apr 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/dam/SalmanB06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/XiongB06,
author = {Liming Xiong and
Hajo Broersma},
title = {Subpancyclicity of line graphs and degree sums along paths},
journal = {Discret. Appl. Math.},
volume = {154},
number = {9},
pages = {1453--1463},
year = {2006},
url = {https://doi.org/10.1016/j.dam.2005.05.039},
doi = {10.1016/J.DAM.2005.05.039},
timestamp = {Thu, 11 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dam/XiongB06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/gc/BauerBS06,
author = {Douglas Bauer and
Hajo Broersma and
Edward F. Schmeichel},
title = {Toughness in Graphs - {A} Survey},
journal = {Graphs Comb.},
volume = {22},
number = {1},
pages = {1--35},
year = {2006},
url = {https://doi.org/10.1007/s00373-006-0649-0},
doi = {10.1007/S00373-006-0649-0},
timestamp = {Sat, 05 Sep 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/gc/BauerBS06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/ciac/BroersmaCP06,
author = {Hajo Broersma and
Agostino Capponi and
Dani{\"{e}}l Paulusma},
editor = {Tiziana Calamoneri and
Irene Finocchi and
Giuseppe F. Italiano},
title = {On-Line Coloring of H-Free Bipartite Graphs},
booktitle = {Algorithms and Complexity, 6th Italian Conference, {CIAC} 2006, Rome,
Italy, May 29-31, 2006, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {3998},
pages = {284--295},
publisher = {Springer},
year = {2006},
url = {https://doi.org/10.1007/11758471\_28},
doi = {10.1007/11758471\_28},
timestamp = {Sun, 25 Oct 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/ciac/BroersmaCP06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/latin/BroersmaJPS06,
author = {Hajo Broersma and
Matthew Johnson and
Dani{\"{e}}l Paulusma and
Iain A. Stewart},
editor = {Jos{\'{e}} R. Correa and
Alejandro Hevia and
Marcos A. Kiwi},
title = {The Computational Complexity of the Parallel Knock-Out Problem},
booktitle = {{LATIN} 2006: Theoretical Informatics, 7th Latin American Symposium,
Valdivia, Chile, March 20-24, 2006, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {3887},
pages = {250--261},
publisher = {Springer},
year = {2006},
url = {https://doi.org/10.1007/11682462\_26},
doi = {10.1007/11682462\_26},
timestamp = {Sat, 05 Sep 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/latin/BroersmaJPS06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@proceedings{DBLP:conf/acid/2006,
editor = {Hajo Broersma and
Stefan S. Dantchev and
Matthew Johnson and
Stefan Szeider},
title = {Algorithms and Complexity in Durham 2006 - Proceedings of the Second
ACiD Workshop, 18-20 September 2006, Durham, {UK}},
series = {Texts in Algorithmics},
volume = {7},
publisher = {King's College, London},
year = {2006},
isbn = {1-904987-38-9},
timestamp = {Tue, 24 Jul 2007 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/acid/2006.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ajc/BroersmaLWZ05,
author = {Hajo Broersma and
Xueliang Li and
Gerhard J. Woeginger and
Shenggui Zhang},
title = {Paths and cycles in colored graphs},
journal = {Australas. {J} Comb.},
volume = {31},
pages = {299--312},
year = {2005},
url = {http://ajc.maths.uq.edu.au/pdf/31/ajc\_v31\_p299.pdf},
timestamp = {Wed, 11 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ajc/BroersmaLWZ05.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgt/XiongRB05,
author = {Liming Xiong and
Zdenek Ryj{\'{a}}cek and
Hajo Broersma},
title = {On stability of the hamiltonian index under contractions and closures},
journal = {J. Graph Theory},
volume = {49},
number = {2},
pages = {104--115},
year = {2005},
url = {https://doi.org/10.1002/jgt.20068},
doi = {10.1002/JGT.20068},
timestamp = {Mon, 26 Jun 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jgt/XiongRB05.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@proceedings{DBLP:conf/acid/2005,
editor = {Hajo Broersma and
Matthew Johnson and
Stefan Szeider},
title = {Algorithms and Complexity in Durham 2005 - Proceedings of the First
ACiD Workshop, 8-10 July 2005, Durham, {UK}},
series = {Texts in Algorithmics},
volume = {4},
publisher = {King's College, London},
year = {2005},
isbn = {1-904987-10-9},
timestamp = {Tue, 24 Jul 2007 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/acid/2005.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/FaiglePBH04,
author = {Ulrich Faigle and
Stefan Pickl and
Hajo Broersma and
Johann L. Hurink},
title = {Preface: The 1st Cologne-Twente Workshop on Graphs and Combinatorial
Optimization},
journal = {Discret. Appl. Math.},
volume = {136},
number = {2-3},
pages = {159--160},
year = {2004},
url = {https://doi.org/10.1016/S0166-218X(03)00437-2},
doi = {10.1016/S0166-218X(03)00437-2},
timestamp = {Thu, 11 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dam/FaiglePBH04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dm/XiongBLL04,
author = {Liming Xiong and
Hajo Broersma and
Xueliang Li and
Mingchu Li},
title = {The hamiltonian index of a graph and its branch-bonds},
journal = {Discret. Math.},
volume = {285},
number = {1-3},
pages = {279--288},
year = {2004},
url = {https://doi.org/10.1016/j.disc.2004.01.018},
doi = {10.1016/J.DISC.2004.01.018},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dm/XiongBLL04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/endm/SalmanB04,
author = {A. N. M. Salman and
Haitze J. Broersma},
title = {The Ramsey Numbers of Paths Versus Kipases},
journal = {Electron. Notes Discret. Math.},
volume = {17},
pages = {251--255},
year = {2004},
url = {https://doi.org/10.1016/j.endm.2004.03.048},
doi = {10.1016/J.ENDM.2004.03.048},
timestamp = {Sat, 09 Apr 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/endm/SalmanB04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamjo/BodlaenderBFPW04,
author = {Hans L. Bodlaender and
Hajo Broersma and
Fedor V. Fomin and
Artem V. Pyatkin and
Gerhard J. Woeginger},
title = {Radio Labeling with Preassigned Frequencies},
journal = {{SIAM} J. Optim.},
volume = {15},
number = {1},
pages = {1--16},
year = {2004},
url = {https://doi.org/10.1137/S1052623402410181},
doi = {10.1137/S1052623402410181},
timestamp = {Mon, 08 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamjo/BodlaenderBFPW04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/colognetwente/SalmanB04,
author = {A. N. M. Salman and
Hajo Broersma},
editor = {Leo Liberti and
Francesco Maffioli},
title = {The Ramsey Numbers of Paths Versus Kipases},
booktitle = {{CTW04} Workshop on Graphs and Combinatorial Optimization, Scientific
Program, Villa Vigoni, Menaggio (CO), Italy, 31st May to 2nd June
2004},
pages = {218--222},
year = {2004},
timestamp = {Tue, 09 Nov 2010 19:23:16 +0100},
biburl = {https://dblp.org/rec/conf/colognetwente/SalmanB04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/fpt/SmitSHBPW04,
author = {Lodewijk T. Smit and
Gerard J. M. Smit and
Johann L. Hurink and
Hajo Broersma and
Dani{\"{e}}l Paulusma and
Pascal T. Wolkotte},
editor = {Oliver Diessel and
John Williams},
title = {Run-time mapping of applications to a heterogeneous reconfigurable
tiled system on chip architecture},
booktitle = {Proceedings of the 2004 {IEEE} International Conference on Field-Programmable
Technology, Brisbane, Australia, December 6-8, 2004},
pages = {421--424},
publisher = {{IEEE}},
year = {2004},
url = {https://doi.org/10.1109/FPT.2004.1393315},
doi = {10.1109/FPT.2004.1393315},
timestamp = {Sat, 05 Sep 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/fpt/SmitSHBPW04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/mfcs/BroersmaFW04,
author = {Hajo Broersma and
Fedor V. Fomin and
Gerhard J. Woeginger},
editor = {Jir{\'{\i}} Fiala and
V{\'{a}}clav Koubek and
Jan Kratochv{\'{\i}}l},
title = {Parallel Knock-Out Schemes in Networks},
booktitle = {Mathematical Foundations of Computer Science 2004, 29th International
Symposium, {MFCS} 2004, Prague, Czech Republic, August 22-27, 2004,
Proceedings},
series = {Lecture Notes in Computer Science},
volume = {3153},
pages = {204--214},
publisher = {Springer},
year = {2004},
url = {https://doi.org/10.1007/978-3-540-28629-5\_13},
doi = {10.1007/978-3-540-28629-5\_13},
timestamp = {Tue, 14 May 2019 10:00:37 +0200},
biburl = {https://dblp.org/rec/conf/mfcs/BroersmaFW04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/wg/BroersmaPSVW04,
author = {Hajo Broersma and
Dani{\"{e}}l Paulusma and
Gerard J. M. Smit and
Frank Vlaardingerbroek and
Gerhard J. Woeginger},
editor = {Juraj Hromkovic and
Manfred Nagl and
Bernhard Westfechtel},
title = {The Computational Complexity of the Minimum Weight Processor Assignment
Problem},
booktitle = {Graph-Theoretic Concepts in Computer Science, 30th International Workshop,WG
2004, Bad Honnef, Germany, June 21-23, 2004, Revised Papers},
series = {Lecture Notes in Computer Science},
volume = {3353},
pages = {189--200},
publisher = {Springer},
year = {2004},
url = {https://doi.org/10.1007/978-3-540-30559-0\_16},
doi = {10.1007/978-3-540-30559-0\_16},
timestamp = {Sat, 05 Sep 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/wg/BroersmaPSVW04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/endm/SalmanB03,
author = {A. N. M. Salman and
Haitze J. Broersma},
title = {The Ramsey Numbers of Paths Versus Fans},
journal = {Electron. Notes Discret. Math.},
volume = {13},
pages = {103--107},
year = {2003},
url = {https://doi.org/10.1016/S1571-0653(04)00448-2},
doi = {10.1016/S1571-0653(04)00448-2},
timestamp = {Sat, 09 Apr 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/endm/SalmanB03.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/endm/BroersmaFHPW03,
author = {Hajo Broersma and
Ulrich Faigle and
Johann L. Hurink and
Stefan Pickl and
Gerhard J. Woeginger},
title = {Preface: Volume 13},
journal = {Electron. Notes Discret. Math.},
volume = {13},
pages = {128},
year = {2003},
url = {https://doi.org/10.1016/S1571-0653(05)80008-3},
doi = {10.1016/S1571-0653(05)80008-3},
timestamp = {Mon, 06 Apr 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/endm/BroersmaFHPW03.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jalc/SalmanBB03,
author = {A. N. M. Salman and
Hajo Broersma and
Edy Tri Baskoro},
title = {Spanning 2-Connected Subgraphs in Alphabet Graphs, Special Classes
of Grid Graphs},
journal = {J. Autom. Lang. Comb.},
volume = {8},
number = {4},
pages = {675--681},
year = {2003},
url = {https://doi.org/10.25596/jalc-2003-675},
doi = {10.25596/JALC-2003-675},
timestamp = {Mon, 11 May 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jalc/SalmanBB03.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/aPcsac/GuoSBRH03,
author = {Yuanqing Guo and
Gerard J. M. Smit and
Hajo Broersma and
Mich{\`{e}}l A. J. Rosien and
Paul M. Heysters},
editor = {Amos Omondi and
Stanislav Sedukhin},
title = {Mapping Applications to a Coarse Grain Reconfigurable System},
booktitle = {Advances in Computer Systems Architecture, 8th Asia-Pacific Conference,
{ACSAC} 2003, Aizu-Wakamatsu, Japan, September 23-26, 2003, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {2823},
pages = {221--235},
publisher = {Springer},
year = {2003},
url = {https://doi.org/10.1007/978-3-540-39864-6\_18},
doi = {10.1007/978-3-540-39864-6\_18},
timestamp = {Sat, 05 Sep 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/aPcsac/GuoSBRH03.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/iwsoc/GuoSBH03,
author = {Yuanqing Guo and
Gerard J. M. Smit and
Hajo Broersma and
Paul M. Heysters},
title = {Template Generation and Selection Algorithms},
booktitle = {Proceedings of the 3rd {IEEE} International Workshop on System-on-Chip
for Real-Time Applications (IWSOC'03), 30 June - 2 July 2003, Calgary,
Alberta, Canada},
pages = {2--6},
publisher = {{IEEE} Computer Society},
year = {2003},
url = {https://doi.org/10.1109/IWSOC.2003.1212995},
doi = {10.1109/IWSOC.2003.1212995},
timestamp = {Thu, 23 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/iwsoc/GuoSBH03.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/jcdcg/Broersma03,
author = {Hajo Broersma},
editor = {Jin Akiyama and
Edy Tri Baskoro and
Mikio Kano},
title = {A General Framework for Coloring Problems: Old Results, New Results,
and Open Problems},
booktitle = {Combinatorial Geometry and Graph Theory, Indonesia-Japan Joint Conference,IJCCGGT
2003, Bandung, Indonesia, September 13-16, 2003, Revised Selected
Papers},
series = {Lecture Notes in Computer Science},
volume = {3330},
pages = {65--79},
publisher = {Springer},
year = {2003},
url = {https://doi.org/10.1007/978-3-540-30540-8\_7},
doi = {10.1007/978-3-540-30540-8\_7},
timestamp = {Sat, 05 Sep 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/jcdcg/Broersma03.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/jcdcg/SurahmatBUB03,
author = {Surahmat and
Edy Tri Baskoro and
Saladin Uttunggadewa and
Hajo Broersma},
editor = {Jin Akiyama and
Edy Tri Baskoro and
Mikio Kano},
title = {An Upper Bound for the Ramsey Number of a Cycle of Length Four Versus
Wheels},
booktitle = {Combinatorial Geometry and Graph Theory, Indonesia-Japan Joint Conference,IJCCGGT
2003, Bandung, Indonesia, September 13-16, 2003, Revised Selected
Papers},
series = {Lecture Notes in Computer Science},
volume = {3330},
pages = {181--184},
publisher = {Springer},
year = {2003},
url = {https://doi.org/10.1007/978-3-540-30540-8\_20},
doi = {10.1007/978-3-540-30540-8\_20},
timestamp = {Sat, 05 Sep 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/jcdcg/SurahmatBUB03.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/lctrts/GuoSBH03,
author = {Yuanqing Guo and
Gerard J. M. Smit and
Hajo Broersma and
Paul M. Heysters},
editor = {Frank Mueller and
Ulrich Kremer},
title = {A graph covering algorithm for a coarse grain reconfigurable system},
booktitle = {Proceedings of the 2003 Conference on Languages, Compilers, and Tools
for Embedded Systems (LCTES'03). San Diego, California, USA, June
11-13, 2003},
pages = {199--208},
publisher = {{ACM}},
year = {2003},
url = {https://doi.org/10.1145/780732.780760},
doi = {10.1145/780732.780760},
timestamp = {Fri, 25 Jun 2021 17:17:37 +0200},
biburl = {https://dblp.org/rec/conf/lctrts/GuoSBH03.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/wg/BroersmaFGW03,
author = {Hajo Broersma and
Fedor V. Fomin and
Petr A. Golovach and
Gerhard J. Woeginger},
editor = {Hans L. Bodlaender},
title = {Backbone Colorings for Networks},
booktitle = {Graph-Theoretic Concepts in Computer Science, 29th International Workshop,
{WG} 2003, Elspeet, The Netherlands, June 19-21, 2003, Revised Papers},
series = {Lecture Notes in Computer Science},
volume = {2880},
pages = {131--142},
publisher = {Springer},
year = {2003},
url = {https://doi.org/10.1007/978-3-540-39890-5\_12},
doi = {10.1007/978-3-540-39890-5\_12},
timestamp = {Sat, 05 Sep 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/wg/BroersmaFGW03.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/BroersmaKKM02,
author = {Hajo Broersma and
Ton Kloks and
Dieter Kratsch and
Haiko M{\"{u}}ller},
title = {A Generalization of AT-Free Graphs and a Generic Algorithm for Solving
Triangulation Problems},
journal = {Algorithmica},
volume = {32},
number = {4},
pages = {594--610},
year = {2002},
url = {https://doi.org/10.1007/s00453-001-0091-x},
doi = {10.1007/S00453-001-0091-X},
timestamp = {Sun, 12 Nov 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/algorithmica/BroersmaKKM02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/computing/BroersmaFNW02,
author = {Hajo Broersma and
Fedor V. Fomin and
Jaroslav Nesetril and
Gerhard J. Woeginger},
title = {More About Subcolorings},
journal = {Computing},
volume = {69},
number = {3},
pages = {187--203},
year = {2002},
url = {https://doi.org/10.1007/s00607-002-1461-1},
doi = {10.1007/S00607-002-1461-1},
timestamp = {Sat, 05 Sep 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/computing/BroersmaFNW02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/BauerBMS02,
author = {Douglas Bauer and
Hajo Broersma and
Aurora Morgana and
Edward F. Schmeichel},
title = {Polynomial algorithms that prove an NP-Hard hypothesis implies an
NP-hard conclusion},
journal = {Discret. Appl. Math.},
volume = {120},
number = {1-3},
pages = {13--23},
year = {2002},
url = {https://doi.org/10.1016/S0166-218X(01)00276-1},
doi = {10.1016/S0166-218X(01)00276-1},
timestamp = {Thu, 11 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dam/BauerBMS02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/BroersmaX02,
author = {Hajo Broersma and
Liming Xiong},
title = {A note on minimum degree conditions for supereulerian graphs},
journal = {Discret. Appl. Math.},
volume = {120},
number = {1-3},
pages = {35--43},
year = {2002},
url = {https://doi.org/10.1016/S0166-218X(01)00278-5},
doi = {10.1016/S0166-218X(01)00278-5},
timestamp = {Thu, 11 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dam/BroersmaX02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/BroersmaL02,
author = {Hajo Broersma and
Xueliang Li},
title = {Some approaches to a conjecture on short cycles in digraphs},
journal = {Discret. Appl. Math.},
volume = {120},
number = {1-3},
pages = {45--53},
year = {2002},
url = {https://doi.org/10.1016/S0166-218X(01)00279-7},
doi = {10.1016/S0166-218X(01)00279-7},
timestamp = {Sun, 22 Oct 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/dam/BroersmaL02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dm/XiongBHL02,
author = {Liming Xiong and
Hajo Broersma and
Cornelis Hoede and
Xueliang Li},
title = {Degree sums and subpancyclicity in line graphs},
journal = {Discret. Math.},
volume = {242},
number = {1-3},
pages = {255--267},
year = {2002},
url = {https://doi.org/10.1016/S0012-365X(00)00468-4},
doi = {10.1016/S0012-365X(00)00468-4},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dm/XiongBHL02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dm/Broersma02,
author = {Hajo Broersma},
title = {On some intriguing problems in hamiltonian graph theory--a survey},
journal = {Discret. Math.},
volume = {251},
number = {1-3},
pages = {47--69},
year = {2002},
url = {https://doi.org/10.1016/S0012-365X(01)00325-9},
doi = {10.1016/S0012-365X(01)00325-9},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dm/Broersma02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dmgt/BondyBHV02,
author = {J. Adrian Bondy and
Hajo Broersma and
Jan van den Heuvel and
Henk Jan Veldman},
title = {Heavy cycles in weighted graphs},
journal = {Discuss. Math. Graph Theory},
volume = {22},
number = {1},
pages = {7--15},
year = {2002},
url = {https://doi.org/10.7151/dmgt.1154},
doi = {10.7151/DMGT.1154},
timestamp = {Sat, 05 Sep 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/dmgt/BondyBHV02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dmgt/BroersmaL02,
author = {Hajo Broersma and
Xueliang Li},
title = {Isomorphisms and traversability of directed path graphs},
journal = {Discuss. Math. Graph Theory},
volume = {22},
number = {2},
pages = {215--228},
year = {2002},
url = {https://doi.org/10.7151/dmgt.1170},
doi = {10.7151/DMGT.1170},
timestamp = {Sat, 05 Sep 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/dmgt/BroersmaL02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/endm/BauerBS02,
author = {Douglas Bauer and
Hajo Broersma and
Edward F. Schmeichel},
title = {More Progress on Tough Graphs - The {Y2K} Report},
journal = {Electron. Notes Discret. Math.},
volume = {11},
pages = {63--80},
year = {2002},
url = {https://doi.org/10.1016/S1571-0653(04)00055-1},
doi = {10.1016/S1571-0653(04)00055-1},
timestamp = {Thu, 20 Feb 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/endm/BauerBS02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/gc/ZhangBLW02,
author = {Shenggui Zhang and
Hajo Broersma and
Xueliang Li and
Ligong Wang},
title = {A Fan Type Condition For Heavy Cycles in Weighted Graphs},
journal = {Graphs Comb.},
volume = {18},
number = {1},
pages = {193--200},
year = {2002},
url = {https://doi.org/10.1007/s003730200012},
doi = {10.1007/S003730200012},
timestamp = {Wed, 21 Apr 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/gc/ZhangBLW02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgt/BroersmaFHTV02,
author = {Hajo Broersma and
Ralph J. Faudree and
Andreas Huck and
Huib Trommel and
Henk Jan Veldman},
title = {Forbidden subgraphs that imply hamiltonian-connectedness},
journal = {J. Graph Theory},
volume = {40},
number = {2},
pages = {104--119},
year = {2002},
url = {https://doi.org/10.1002/jgt.10034},
doi = {10.1002/JGT.10034},
timestamp = {Fri, 02 Oct 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jgt/BroersmaFHTV02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/esa/BodlaenderBFPW02,
author = {Hans L. Bodlaender and
Hajo Broersma and
Fedor V. Fomin and
Artem V. Pyatkin and
Gerhard J. Woeginger},
editor = {Rolf H. M{\"{o}}hring and
Rajeev Raman},
title = {Radio Labeling with Pre-assigned Frequencies},
booktitle = {Algorithms - {ESA} 2002, 10th Annual European Symposium, Rome, Italy,
September 17-21, 2002, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {2461},
pages = {211--222},
publisher = {Springer},
year = {2002},
url = {https://doi.org/10.1007/3-540-45749-6\_22},
doi = {10.1007/3-540-45749-6\_22},
timestamp = {Sat, 05 Sep 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/esa/BodlaenderBFPW02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/swat/BroersmaFKW02,
author = {Hajo Broersma and
Fedor V. Fomin and
Jan Kratochv{\'{\i}}l and
Gerhard J. Woeginger},
editor = {Martti Penttonen and
Erik Meineche Schmidt},
title = {Planar Graph Coloring with Forbidden Subgraphs: Why Trees and Paths
Are Dangerous},
booktitle = {Algorithm Theory - {SWAT} 2002, 8th Scandinavian Workshop on Algorithm
Theory, Turku, Finland, July 3-5, 2002 Proceedings},
series = {Lecture Notes in Computer Science},
volume = {2368},
pages = {160--169},
publisher = {Springer},
year = {2002},
url = {https://doi.org/10.1007/3-540-45471-3\_17},
doi = {10.1007/3-540-45471-3\_17},
timestamp = {Sat, 05 Sep 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/swat/BroersmaFKW02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/wg/BroersmaFNW02,
author = {Hajo Broersma and
Fedor V. Fomin and
Jaroslav Nesetril and
Gerhard J. Woeginger},
editor = {Ludek Kucera},
title = {More about Subcolorings},
booktitle = {Graph-Theoretic Concepts in Computer Science, 28th International Workshop,
{WG} 2002, Cesky Krumlov, Czech Republic, June 13-15, 2002, Revised
Papers},
series = {Lecture Notes in Computer Science},
volume = {2573},
pages = {68--79},
publisher = {Springer},
year = {2002},
url = {https://doi.org/10.1007/3-540-36379-3\_7},
doi = {10.1007/3-540-36379-3\_7},
timestamp = {Tue, 14 May 2019 10:00:40 +0200},
biburl = {https://dblp.org/rec/conf/wg/BroersmaFNW02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dm/BroersmaR01,
author = {Hajo Broersma and
Zdenek Ryj{\'{a}}cek},
title = {Strengthening the closure concept in claw-free graphs},
journal = {Discret. Math.},
volume = {233},
number = {1-3},
pages = {55--63},
year = {2001},
url = {https://doi.org/10.1016/S0012-365X(00)00226-0},
doi = {10.1016/S0012-365X(00)00226-0},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dm/BroersmaR01.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dmgt/BroersmaLZ01,
author = {Hajo Broersma and
Xueliang Li and
Shenggui Zhang},
title = {A \emph{{\(\sigma\)}\({}_{\mbox{3}}\)} type condition for heavy cycles
in weighted graphs},
journal = {Discuss. Math. Graph Theory},
volume = {21},
number = {2},
pages = {159--166},
year = {2001},
url = {https://doi.org/10.7151/dmgt.1140},
doi = {10.7151/DMGT.1140},
timestamp = {Sat, 05 Sep 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/dmgt/BroersmaLZ01.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/endm/BroersmaFHP01,
author = {Hajo Broersma and
Ulrich Faigle and
Johann L. Hurink and
Stefan Pickl},
title = {Preface: Volume 8},
journal = {Electron. Notes Discret. Math.},
volume = {8},
pages = {1},
year = {2001},
url = {https://doi.org/10.1016/S1571-0653(05)80063-0},
doi = {10.1016/S1571-0653(05)80063-0},
timestamp = {Sat, 05 Sep 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/endm/BroersmaFHP01.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/endm/LiZB01,
author = {Xueliang Li and
Shenggui Zhang and
Hajo Broersma},
title = {Paths and Cycles in Colored Graphs},
journal = {Electron. Notes Discret. Math.},
volume = {8},
pages = {128--132},
year = {2001},
url = {https://doi.org/10.1016/S1571-0653(05)80098-8},
doi = {10.1016/S1571-0653(05)80098-8},
timestamp = {Thu, 14 Oct 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/endm/LiZB01.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgt/BroersmaKR01,
author = {Haitze J. Broersma and
Matthias Kriesell and
Zdenek Ryj{\'{a}}cek},
title = {On factors of 4-connected claw-free graphs},
journal = {J. Graph Theory},
volume = {37},
number = {2},
pages = {125--136},
year = {2001},
url = {https://doi.org/10.1002/jgt.1008},
doi = {10.1002/JGT.1008},
timestamp = {Fri, 02 Oct 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jgt/BroersmaKR01.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/BauerBV00,
author = {Douglas Bauer and
Hajo Broersma and
Henk Jan Veldman},
title = {Not Every 2-tough Graph Is Hamiltonian},
journal = {Discret. Appl. Math.},
volume = {99},
number = {1-3},
pages = {317--321},
year = {2000},
url = {https://doi.org/10.1016/S0166-218X(99)00141-9},
doi = {10.1016/S0166-218X(99)00141-9},
timestamp = {Thu, 11 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dam/BauerBV00.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/BroersmaDK00,
author = {Hajo Broersma and
Elias Dahlhaus and
Ton Kloks},
title = {A Linear Time Algorithm for Minimum Fill-in and Treewidth for Distance
Hereditary Graphs},
journal = {Discret. Appl. Math.},
volume = {99},
number = {1-3},
pages = {367--400},
year = {2000},
url = {https://doi.org/10.1016/S0166-218X(99)00146-8},
doi = {10.1016/S0166-218X(99)00146-8},
timestamp = {Thu, 11 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dam/BroersmaDK00.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dm/ZhangLB00,
author = {Shenggui Zhang and
Xueliang Li and
Hajo Broersma},
title = {Heavy paths and cycles in weighted graphs},
journal = {Discret. Math.},
volume = {223},
number = {1-3},
pages = {327--336},
year = {2000},
url = {https://doi.org/10.1016/S0012-365X(99)00413-6},
doi = {10.1016/S0012-365X(99)00413-6},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dm/ZhangLB00.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/gc/BroersmaRS00,
author = {Hajo Broersma and
Zdenek Ryj{\'{a}}cek and
Ingo Schiermeyer},
title = {Closure Concepts: {A} Survey},
journal = {Graphs Comb.},
volume = {16},
number = {1},
pages = {17--48},
year = {2000},
url = {https://doi.org/10.1007/s003730050002},
doi = {10.1007/S003730050002},
timestamp = {Mon, 26 Jun 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/gc/BroersmaRS00.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/networks/BroersmaKTHKKM00,
author = {Hajo Broersma and
Otto R. Koppius and
Hilde Tuinstra and
Andreas Huck and
Ton Kloks and
Dieter Kratsch and
Haiko M{\"{u}}ller},
title = {Degree-preserving trees},
journal = {Networks},
volume = {35},
number = {1},
pages = {26--39},
year = {2000},
url = {https://doi.org/10.1002/(SICI)1097-0037(200001)35:1\&\#60;26::AID-NET3\&\#62;3.0.CO;2-M},
doi = {10.1002/(SICI)1097-0037(200001)35:1\&\#60;26::AID-NET3\&\#62;3.0.CO;2-M},
timestamp = {Sun, 28 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/networks/BroersmaKTHKKM00.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/arscom/BroersmaH99,
author = {Hajo Broersma and
Cornelis Hoede},
title = {Another equivalent of the graceful tree conjecture},
journal = {Ars Comb.},
volume = {51},
year = {1999},
timestamp = {Tue, 06 Jan 2004 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/arscom/BroersmaH99.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/networks/BroersmaET99,
author = {Hajo Broersma and
Erik Engbers and
Huib Trommel},
title = {Various results on the toughness of graphs},
journal = {Networks},
volume = {33},
number = {3},
pages = {233--238},
year = {1999},
url = {https://doi.org/10.1002/(SICI)1097-0037(199905)33:3\&\#60;233::AID-NET9\&\#62;3.0.CO;2-A},
doi = {10.1002/(SICI)1097-0037(199905)33:3\&\#60;233::AID-NET9\&\#62;3.0.CO;2-A},
timestamp = {Sun, 28 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/networks/BroersmaET99.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamdm/BroersmaKKM99,
author = {Hajo Broersma and
Ton Kloks and
Dieter Kratsch and
Haiko M{\"{u}}ller},
title = {Independent Sets in Asteroidal Triple-Free Graphs},
journal = {{SIAM} J. Discret. Math.},
volume = {12},
number = {2},
pages = {276--287},
year = {1999},
url = {https://doi.org/10.1137/S0895480197326346},
doi = {10.1137/S0895480197326346},
timestamp = {Sun, 12 Nov 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/siamdm/BroersmaKKM99.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dm/BroersmaT98,
author = {Hajo Broersma and
Huib Trommel},
title = {Closure concepts for claw-free graphs},
journal = {Discret. Math.},
volume = {185},
number = {1-3},
pages = {231--238},
year = {1998},
url = {https://doi.org/10.1016/S0012-365X(97)00210-0},
doi = {10.1016/S0012-365X(97)00210-0},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dm/BroersmaT98.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgt/BroersmaT98,
author = {Hajo Broersma and
Hilde Tuinstra},
title = {Independence trees and Hamilton cycles},
journal = {J. Graph Theory},
volume = {29},
number = {4},
pages = {227--237},
year = {1998},
url = {https://doi.org/10.1002/(SICI)1097-0118(199812)29:4\&\#60;227::AID-JGT2\&\#62;3.0.CO;2-W},
doi = {10.1002/(SICI)1097-0118(199812)29:4\&\#60;227::AID-JGT2\&\#62;3.0.CO;2-W},
timestamp = {Fri, 02 Oct 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jgt/BroersmaT98.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/mfcs/BroersmaHKKKMT98,
author = {Hajo Broersma and
Andreas Huck and
Ton Kloks and
Otto R. Koppius and
Dieter Kratsch and
Haiko M{\"{u}}ller and
Hilde Tuinstra},
editor = {Lubos Brim and
Jozef Gruska and
Jir{\'{\i}} Zlatuska},
title = {Degree-Preserving Forests},
booktitle = {Mathematical Foundations of Computer Science 1998, 23rd International
Symposium, MFCS'98, Brno, Czech Republic, August 24-28, 1998, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {1450},
pages = {713--721},
publisher = {Springer},
year = {1998},
url = {https://doi.org/10.1007/BFb0055822},
doi = {10.1007/BFB0055822},
timestamp = {Sun, 12 Nov 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/mfcs/BroersmaHKKKMT98.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/wg/BroersmaKKM98,
author = {Hajo Broersma and
Ton Kloks and
Dieter Kratsch and
Haiko M{\"{u}}ller},
editor = {Juraj Hromkovic and
Ondrej S{\'{y}}kora},
title = {A Generalization of AT-free Graphs and a Generic Algorithm for Solving
Treewidth, Minimum Fill-In and Vertex Ranking},
booktitle = {Graph-Theoretic Concepts in Computer Science, 24th International Workshop,
{WG} '98, Smolenice Castle, Slovak Republic, June 18-20, 1998, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {1517},
pages = {88--99},
publisher = {Springer},
year = {1998},
url = {https://doi.org/10.1007/10692760\_8},
doi = {10.1007/10692760\_8},
timestamp = {Sun, 12 Nov 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/wg/BroersmaKKM98.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dm/Broersma97,
author = {Haitze J. Broersma},
title = {A note on the minimum size of a vertex pancyclic graph},
journal = {Discret. Math.},
volume = {164},
number = {1-3},
pages = {29--32},
year = {1997},
url = {https://doi.org/10.1016/S0012-365X(96)00040-4},
doi = {10.1016/S0012-365X(96)00040-4},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dm/Broersma97.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dm/BroersmaRS97,
author = {Haitze J. Broersma and
Zdenek Ryj{\'{a}}cek and
Ingo Schiermeyer},
title = {Dirac's minimum degree condition restricted to claws},
journal = {Discret. Math.},
volume = {167-168},
pages = {155--166},
year = {1997},
url = {https://doi.org/10.1016/S0012-365X(96)00224-5},
doi = {10.1016/S0012-365X(96)00224-5},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dm/BroersmaRS97.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dm/BohmeBGKS97,
author = {Thomas B{\"{o}}hme and
Hajo Broersma and
F. G{\"{o}}bel and
Alexandr V. Kostochka and
Michael Stiebitz},
title = {Spanning trees with pairwise nonadjacent endvertices},
journal = {Discret. Math.},
volume = {170},
number = {1-3},
pages = {219--222},
year = {1997},
url = {https://doi.org/10.1016/S0012-365X(96)00306-8},
doi = {10.1016/S0012-365X(96)00306-8},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dm/BohmeBGKS97.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dm/BroersmaLLTV97,
author = {Hajo Broersma and
Hao Li and
Jianping Li and
Feng Tian and
Henk Jan Veldman},
title = {Cycles through subsets with large degree sums},
journal = {Discret. Math.},
volume = {171},
number = {1-3},
pages = {43--54},
year = {1997},
url = {https://doi.org/10.1016/S0012-365X(96)00071-4},
doi = {10.1016/S0012-365X(96)00071-4},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dm/BroersmaLLTV97.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dmgt/BroersmaL97,
author = {Hajo Broersma and
Xueliang Li},
title = {Spanning trees with many or few colors in edge-colored graphs},
journal = {Discuss. Math. Graph Theory},
volume = {17},
number = {2},
pages = {259--269},
year = {1997},
url = {https://doi.org/10.7151/dmgt.1053},
doi = {10.7151/DMGT.1053},
timestamp = {Sat, 05 Sep 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/dmgt/BroersmaL97.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/icalp/BroersmaKKM97,
author = {Hajo Broersma and
Ton Kloks and
Dieter Kratsch and
Haiko M{\"{u}}ller},
editor = {Pierpaolo Degano and
Roberto Gorrieri and
Alberto Marchetti{-}Spaccamela},
title = {Independent Sets in Asteroidal Triple-Free Graphs},
booktitle = {Automata, Languages and Programming, 24th International Colloquium,
ICALP'97, Bologna, Italy, 7-11 July 1997, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {1256},
pages = {760--770},
publisher = {Springer},
year = {1997},
url = {https://doi.org/10.1007/3-540-63165-8\_229},
doi = {10.1007/3-540-63165-8\_229},
timestamp = {Sun, 12 Nov 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/icalp/BroersmaKKM97.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/wg/BroersmaDK97,
author = {Hajo Broersma and
Elias Dahlhaus and
Ton Kloks},
editor = {Rolf H. M{\"{o}}hring},
title = {Algorithms for the Treewidth and Minimum Fill-in of HHD-Free Graphs},
booktitle = {Graph-Theoretic Concepts in Computer Science, 23rd International Workshop,
{WG} '97, Berlin, Germany, June 18-20, 1997, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {1335},
pages = {109--117},
publisher = {Springer},
year = {1997},
url = {https://doi.org/10.1007/BFb0024492},
doi = {10.1007/BFB0024492},
timestamp = {Sat, 05 Sep 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/wg/BroersmaDK97.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/arscom/BroersmaL96,
author = {Hajo Broersma and
Xueliang Li},
title = {The connectivity of the leaf-exchange spanning tree graph of a graph},
journal = {Ars Comb.},
volume = {43},
year = {1996},
timestamp = {Sat, 11 Nov 2017 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/arscom/BroersmaL96.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgt/AsratianBHV96,
author = {Armen S. Asratian and
Haitze J. Broersma and
Jan van den Heuvel and
Henk Jan Veldman},
title = {On graphs satisfying a local ore-type condition},
journal = {J. Graph Theory},
volume = {21},
number = {1},
pages = {1--10},
year = {1996},
url = {https://doi.org/10.1002/(SICI)1097-0118(199601)21:1\&\#60;1::AID-JGT1\&\#62;3.0.CO;2-W},
doi = {10.1002/(SICI)1097-0118(199601)21:1\&\#60;1::AID-JGT1\&\#62;3.0.CO;2-W},
timestamp = {Fri, 02 Oct 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jgt/AsratianBHV96.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgt/BroersmaRS96,
author = {Haitze J. Broersma and
Zdenek Ryj{\'{a}}cek and
Ingo Schiermeyer},
title = {Toughness and hamiltonicity in almost claw-free graphs},
journal = {J. Graph Theory},
volume = {21},
number = {4},
pages = {431--439},
year = {1996},
url = {https://doi.org/10.1002/(SICI)1097-0118(199604)21:4\&\#60;431::AID-JGT9\&\#62;3.0.CO;2-Q},
doi = {10.1002/(SICI)1097-0118(199604)21:4\&\#60;431::AID-JGT9\&\#62;3.0.CO;2-Q},
timestamp = {Fri, 02 Oct 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jgt/BroersmaRS96.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgt/BroersmaHJV96,
author = {Haitze J. Broersma and
Jan van den Heuvel and
Bill Jackson and
Henk Jan Veldman},
title = {Hamiltonicity of regular 2-connected graphs},
journal = {J. Graph Theory},
volume = {22},
number = {2},
pages = {105--124},
year = {1996},
url = {https://doi.org/10.1002/(SICI)1097-0118(199606)22:2\&\#60;105::AID-JGT2\&\#62;3.0.CO;2-R},
doi = {10.1002/(SICI)1097-0118(199606)22:2\&\#60;105::AID-JGT2\&\#62;3.0.CO;2-R},
timestamp = {Fri, 02 Oct 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jgt/BroersmaHJV96.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgt/BohmeBV96,
author = {Thomas B{\"{o}}hme and
Haitze J. Broersma and
Henk Jan Veldman},
title = {Toughness and longest cycles in 2-connected planar graphs},
journal = {J. Graph Theory},
volume = {23},
number = {3},
pages = {257--263},
year = {1996},
url = {https://doi.org/10.1002/(SICI)1097-0118(199611)23:3\&\#60;257::AID-JGT5\&\#62;3.0.CO;2-R},
doi = {10.1002/(SICI)1097-0118(199611)23:3\&\#60;257::AID-JGT5\&\#62;3.0.CO;2-R},
timestamp = {Fri, 02 Oct 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jgt/BohmeBV96.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/arscom/BauerBV95,
author = {Douglas Bauer and
Haitze J. Broersma and
Henk Jan Veldman},
title = {On generalizing a theorem of Jung},
journal = {Ars Comb.},
volume = {40},
year = {1995},
timestamp = {Wed, 04 Apr 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/arscom/BauerBV95.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dm/BauerBHV95,
author = {Douglas Bauer and
Haitze J. Broersma and
Jan van den Heuvel and
Henk Jan Veldman},
title = {Long cycles in graphs with prescribed toughness and minimum degree},
journal = {Discret. Math.},
volume = {141},
number = {1-3},
pages = {1--10},
year = {1995},
url = {https://doi.org/10.1016/0012-365X(93)E0204-H},
doi = {10.1016/0012-365X(93)E0204-H},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dm/BauerBHV95.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgt/BroersmaL95,
author = {Haitze J. Broersma and
M. Lu},
title = {Cycles through particular subgraphs of claw-free graphs},
journal = {J. Graph Theory},
volume = {20},
number = {4},
pages = {459--465},
year = {1995},
url = {https://doi.org/10.1002/jgt.3190200409},
doi = {10.1002/JGT.3190200409},
timestamp = {Fri, 02 Oct 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jgt/BroersmaL95.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/networks/BroersmaG95,
author = {Haitze J. Broersma and
F. G{\"{o}}bel},
title = {Bipartite regular graphs with fixed diameter},
journal = {Networks},
volume = {26},
number = {3},
pages = {139--144},
year = {1995},
url = {https://doi.org/10.1002/net.3230260303},
doi = {10.1002/NET.3230260303},
timestamp = {Sat, 05 Sep 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/networks/BroersmaG95.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/BroersmaS94,
author = {Hajo Broersma and
Ingo Schiermeyer},
title = {Subgraphs, Closures and Hamiltonicity},
journal = {Discret. Appl. Math.},
volume = {51},
number = {1-2},
pages = {39--46},
year = {1994},
url = {https://doi.org/10.1016/0166-218X(94)90092-2},
doi = {10.1016/0166-218X(94)90092-2},
timestamp = {Thu, 11 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dam/BroersmaS94.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dm/BroersmaS94,
author = {Haitze J. Broersma and
Ingo Schiermeyer},
title = {A closure concept based on neighborhood unions of independent triples},
journal = {Discret. Math.},
volume = {124},
number = {1-3},
pages = {37--47},
year = {1994},
url = {https://doi.org/10.1016/0012-365X(92)00049-W},
doi = {10.1016/0012-365X(92)00049-W},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dm/BroersmaS94.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/BroersmaX93,
author = {Hajo Broersma and
Xueliang Li},
title = {On "The Matching Polynomial of a Polygraph"},
journal = {Discret. Appl. Math.},
volume = {46},
number = {1},
pages = {79--86},
year = {1993},
url = {https://doi.org/10.1016/0166-218X(93)90159-L},
doi = {10.1016/0166-218X(93)90159-L},
timestamp = {Thu, 11 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dam/BroersmaX93.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dm/BroersmaG93,
author = {Haitze J. Broersma and
F. G{\"{o}}bel},
title = {Coloring a graph optimally with two colors},
journal = {Discret. Math.},
volume = {118},
number = {1-3},
pages = {23--31},
year = {1993},
url = {https://doi.org/10.1016/0012-365X(93)90050-4},
doi = {10.1016/0012-365X(93)90050-4},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dm/BroersmaG93.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dm/Broersma93,
author = {Haitze J. Broersma},
title = {A note on K\({}_{\mbox{4}}\)-closures in hamiltonian graph theory},
journal = {Discret. Math.},
volume = {121},
number = {1-3},
pages = {19--23},
year = {1993},
url = {https://doi.org/10.1016/0012-365X(93)90533-Y},
doi = {10.1016/0012-365X(93)90533-Y},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dm/Broersma93.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dm/BroersmaHV93,
author = {Haitze J. Broersma and
Jan van den Heuvel and
Henk Jan Veldman},
title = {Long cycles, degree sums and neighborhood unions},
journal = {Discret. Math.},
volume = {121},
number = {1-3},
pages = {25--35},
year = {1993},
url = {https://doi.org/10.1016/0012-365X(93)90534-Z},
doi = {10.1016/0012-365X(93)90534-Z},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dm/BroersmaHV93.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dm/BroersmaHV93a,
author = {Haitze J. Broersma and
Jan van den Heuvel and
Henk Jan Veldman},
title = {A generalization of Ore's Theorem involving neighborhood unions},
journal = {Discret. Math.},
volume = {122},
number = {1-3},
pages = {37--49},
year = {1993},
url = {https://doi.org/10.1016/0012-365X(93)90285-2},
doi = {10.1016/0012-365X(93)90285-2},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dm/BroersmaHV93a.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/gc/BroersmaHJV93,
author = {Haitze J. Broersma and
Jan van den Heuvel and
Heinz Adolf Jung and
Henk Jan Veldman},
title = {Long paths and cycles in tough graphs},
journal = {Graphs Comb.},
volume = {9},
number = {1},
pages = {3--17},
year = {1993},
url = {https://doi.org/10.1007/BF01195323},
doi = {10.1007/BF01195323},
timestamp = {Sat, 23 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/gc/BroersmaHJV93.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgt/BroersmaHJV93,
author = {Haitze J. Broersma and
Jan van den Heuvel and
Heinz Adolf Jung and
Henk Jan Veldman},
title = {Cycles containing all vertices of maximum degree},
journal = {J. Graph Theory},
volume = {17},
number = {3},
pages = {373--385},
year = {1993},
url = {https://doi.org/10.1002/jgt.3190170311},
doi = {10.1002/JGT.3190170311},
timestamp = {Sat, 23 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jgt/BroersmaHJV93.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgt/BroersmaDG93,
author = {Haitze J. Broersma and
A. J. W. Duijvestijn and
F. G{\"{o}}bel},
title = {Generating all 3-connected 4-regular planar graphs from the octahedron
graph},
journal = {J. Graph Theory},
volume = {17},
number = {5},
pages = {613--620},
year = {1993},
url = {https://doi.org/10.1002/jgt.3190170508},
doi = {10.1002/JGT.3190170508},
timestamp = {Fri, 02 Oct 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jgt/BroersmaDG93.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/networks/BroersmaFHV93,
author = {Haitze J. Broersma and
Ralph J. Faudree and
Jan van den Heuvel and
Henk Jan Veldman},
title = {Decomposition of bipartite graphs under degree constraints},
journal = {Networks},
volume = {23},
number = {3},
pages = {159--164},
year = {1993},
url = {https://doi.org/10.1002/net.3230230303},
doi = {10.1002/NET.3230230303},
timestamp = {Sat, 05 Sep 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/networks/BroersmaFHV93.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgt/BroersmaL92,
author = {Haitze J. Broersma and
Xueliang Li},
title = {The connectivity of the basis graph of a branching greedoid},
journal = {J. Graph Theory},
volume = {16},
number = {3},
pages = {233--237},
year = {1992},
url = {https://doi.org/10.1002/jgt.3190160306},
doi = {10.1002/JGT.3190160306},
timestamp = {Fri, 02 Oct 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jgt/BroersmaL92.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamrev/BroersmaLS92,
author = {Haitze J. Broersma and
Andy Liu and
L. V. Saxton},
title = {An Affirmative Action Graph {(D.} J. Newman)},
journal = {{SIAM} Rev.},
volume = {34},
number = {4},
pages = {652--653},
year = {1992},
url = {https://doi.org/10.1137/1034126},
doi = {10.1137/1034126},
timestamp = {Tue, 29 Sep 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamrev/BroersmaLS92.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgt/BroersmaV91,
author = {Haitze J. Broersma and
Henk Jan Veldman},
title = {Long dominating cycles and paths in graphs with large neighborhood
unions},
journal = {J. Graph Theory},
volume = {15},
number = {1},
pages = {29--38},
year = {1991},
url = {https://doi.org/10.1002/jgt.3190150106},
doi = {10.1002/JGT.3190150106},
timestamp = {Fri, 02 Oct 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jgt/BroersmaV91.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jct/BauerBVR89,
author = {Douglas Bauer and
Hajo Broersma and
Henk Jan Veldman and
Li Rao},
title = {A generalization of a result of H{\"{a}}ggkvist and Nicoghossian},
journal = {J. Comb. Theory, Ser. {B}},
volume = {47},
number = {2},
pages = {237--243},
year = {1989},
url = {https://doi.org/10.1016/0095-8956(89)90023-3},
doi = {10.1016/0095-8956(89)90023-3},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jct/BauerBVR89.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgt/BroersmaH89,
author = {Haitze J. Broersma and
Cornelis Hoede},
title = {Path graphs},
journal = {J. Graph Theory},
volume = {13},
number = {4},
pages = {427--444},
year = {1989},
url = {https://doi.org/10.1002/jgt.3190130406},
doi = {10.1002/JGT.3190130406},
timestamp = {Fri, 02 Oct 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jgt/BroersmaH89.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgt/Broersma88,
author = {Haitze J. Broersma},
title = {Existence of {\(\Delta\)}\({}_{\mbox{{\(\lambda\)}}}\)-cycles and
{\(\Delta\)}\({}_{\mbox{{\(\lambda\)}}}\)-paths},
journal = {J. Graph Theory},
volume = {12},
number = {4},
pages = {499--507},
year = {1988},
url = {https://doi.org/10.1002/jgt.3190120405},
doi = {10.1002/JGT.3190120405},
timestamp = {Fri, 02 Oct 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jgt/Broersma88.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgt/BroersmaV87,
author = {Haitze J. Broersma and
Henk Jan Veldman},
title = {3-Connected line graphs of triangular graphs are panconnected and
1-hamiltonian},
journal = {J. Graph Theory},
volume = {11},
number = {3},
pages = {399--407},
year = {1987},
url = {https://doi.org/10.1002/jgt.3190110314},
doi = {10.1002/JGT.3190110314},
timestamp = {Fri, 02 Oct 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jgt/BroersmaV87.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
a service of 
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
last updated on 2024-04-25 01:13 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
