Bert Randerath

856 total citations
35 papers, 455 citations indexed

About

Bert Randerath is a scholar working on Computational Theory and Mathematics, Discrete Mathematics and Combinatorics and Electrical and Electronic Engineering. According to data from OpenAlex, Bert Randerath has authored 35 papers receiving a total of 455 indexed citations (citations by other indexed papers that have themselves been cited), including 34 papers in Computational Theory and Mathematics, 13 papers in Discrete Mathematics and Combinatorics and 8 papers in Electrical and Electronic Engineering. Recurrent topics in Bert Randerath's work include Advanced Graph Theory Research (33 papers), Graph Labeling and Dimension Problems (20 papers) and Limits and Structures in Graph Theory (13 papers). Bert Randerath is often cited by papers focused on Advanced Graph Theory Research (33 papers), Graph Labeling and Dimension Problems (20 papers) and Limits and Structures in Graph Theory (13 papers). Bert Randerath collaborates with scholars based in Germany, Denmark and United States. Bert Randerath's co-authors include Ingo Schiermeyer, Lutz Volkmann, Van Bang Lê, T. Nießen, Preben Dahl Vestergaard, Martin Kochol, Vadim Lozin, Hong Wang, Michael A. Henning and Ewald Speckenmeyer and has published in prestigious journals such as SIAM Journal on Computing, Theoretical Computer Science and Discrete Applied Mathematics.

In The Last Decade

Bert Randerath

34 papers receiving 439 citations

Peers — A (Enhanced Table)

Peers by citation overlap · career bar shows stage (early→late) cites · hero ref

Name	h						Papers	Cites
Bert Randerath Germany	12	436	238	78	72	65	35	455
Vassilis Giakoumakis France	11	284 0.7×	119 0.5×	55 0.7×	42 0.6×	58 0.9×	21	294
Bogdan Oporowski United States	9	300 0.7×	143 0.6×	76 1.0×	50 0.7×	56 0.9×	21	317
Gábor Bacsó Hungary	9	263 0.6×	142 0.6×	31 0.4×	68 0.9×	41 0.6×	33	284
Keith Edwards United Kingdom	10	295 0.7×	103 0.4×	38 0.5×	86 1.2×	32 0.5×	29	307
Evelyne Flandrin France	12	374 0.9×	172 0.7×	147 1.9×	61 0.8×	122 1.9×	41	416
B. Jamison United States	9	341 0.8×	87 0.4×	69 0.9×	52 0.7×	90 1.4×	11	350
Marietjie Frick South Africa	10	300 0.7×	194 0.8×	72 0.9×	61 0.8×	35 0.5×	45	317
Andrzej Czygrinow United States	10	177 0.4×	142 0.6×	72 0.9×	50 0.7×	48 0.7×	34	225
Stanley Fiorini United Kingdom	8	280 0.6×	125 0.5×	131 1.7×	77 1.1×	31 0.5×	26	329
Mieczysław Borowiecki Poland	9	256 0.6×	156 0.7×	84 1.1×	65 0.9×	14 0.2×	41	281

Countries citing papers authored by Bert Randerath

Since Specialization

Citations

This map shows the geographic impact of Bert Randerath's research. It shows the number of citations coming from papers published by authors working in each country. You can also color the map by specialization and compare the number of citations received by Bert Randerath with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Bert Randerath more than expected).

Fields of papers citing papers by Bert Randerath

Since Specialization

Physical SciencesHealth SciencesLife SciencesSocial Sciences

This network shows the impact of papers produced by Bert Randerath. Nodes represent research fields, and links connect fields that are likely to share authors. Colored nodes show fields that tend to cite the papers produced by Bert Randerath. The network helps show where Bert Randerath may publish in the future.

Co-authorship network of co-authors of Bert Randerath

This figure shows the co-authorship network connecting the top 25 collaborators of Bert Randerath. A scholar is included among the top collaborators of Bert Randerath based on the total number of citations received by their joint publications. Widths of edges represent the number of papers authors have co-authored together. Node borders signify the number of papers an author published with Bert Randerath. Bert Randerath is excluded from the visualization to improve readability, since they are connected to all nodes in the network.

All Works

Sort: Min cites: Since: Top N: Style:

20 of 20 papers shown

Randerath, Bert, et al.. (2018). On the chromatic number of 2K2-free graphs. Discrete Applied Mathematics. 253. 14–24. 20 indexed citations

Randerath, Bert, et al.. (2015). A lower bound on the independence number of a graph in terms of degrees and local clique sizes. Discrete Applied Mathematics. 209. 59–67. 3 indexed citations

Henning, Michael A., et al.. (2010). On a conjecture about inverse domination in graphs. Ars Combinatoria. 129–143. 8 indexed citations

Henning, Michael A., et al.. (2008). An upper bound on the domination number of a graph with minimum degree 2. Discrete Mathematics. 309(4). 639–646. 3 indexed citations

Randerath, Bert & Preben Dahl Vestergaard. (2008). All P3-equipackable graphs. Discrete Mathematics. 310(2). 355–359.

Lê, Van Bang, Bert Randerath, & Ingo Schiermeyer. (2007). On the complexity of 4-coloring graphs without long induced paths. Theoretical Computer Science. 389(1-2). 330–335. 15 indexed citations

Randerath, Bert & Preben Dahl Vestergaard. (2006). Well-covered graphs and factors. Discrete Applied Mathematics. 154(9). 1416–1428. 4 indexed citations

Randerath, Bert. (2003). 3-Colorability and forbidden subgraphs. I: Characterizing pairs. Discrete Mathematics. 276(1-3). 313–325. 15 indexed citations

Randerath, Bert & Ingo Schiermeyer. (2003). 3-Colorability ∈P for P6-free graphs. Discrete Applied Mathematics. 136(2-3). 299–313. 45 indexed citations

10.

Lê, Van Bang & Bert Randerath. (2003). On stable cutsets in line graphs. Theoretical Computer Science. 301(1-3). 463–475. 20 indexed citations

11.

Randerath, Bert & Ingo Schiermeyer. (2002). A note on Brooks' theorem for triangle-free graphs. Australas. J Comb.. 26. 3–10. 10 indexed citations

12.

Randerath, Bert, et al.. (2002). Three-colourability and forbidden subgraphs. II: polynomial algorithms. Discrete Mathematics. 251(1-3). 137–153. 37 indexed citations

13.

Randerath, Bert, et al.. (2002). Vertex pancyclic graphs. Discrete Applied Mathematics. 120(1-3). 219–237. 23 indexed citations

14.

Harant, Jochen, et al.. (2001). On weights of induced paths and cycles in claw-free andK1,r-free graphs. Journal of Graph Theory. 36(3). 131–143. 2 indexed citations

15.

Schiermeyer, Ingo & Bert Randerath. (1999). Colouring graphs with prescribed induced cycle lengths. Symposium on Discrete Algorithms. 965–966. 5 indexed citations

16.

Randerath, Bert, Ingo Schiermeyer, & Hong Wang. (1999). On quadrilaterals in a graph. Discrete Mathematics. 203(1-3). 229–237. 11 indexed citations

17.

Nießen, T. & Bert Randerath. (1998). Regular factors of simple regular graphs and factor-spectra. Discrete Mathematics. 185(1-3). 89–103. 15 indexed citations

18.

Randerath, Bert & Lutz Volkmann. (1998). Characterization of graphs with equal domination and covering number. Discrete Mathematics. 191(1-3). 159–169. 20 indexed citations

19.

Randerath, Bert & Lutz Volkmann. (1997). Simplicial Graphs and Relationships to Different Graph Invariants.. Ars Combinatoria. 46(2). 247–53. 3 indexed citations

20.

Randerath, Bert & Lutz Volkmann. (1994). A characterization of well covered block-cactus graphs.. RWTH Publications (RWTH Aachen). 9. 307. 8 indexed citations

Rankless uses publication and citation data sourced from OpenAlex, an open and comprehensive bibliographic database. While OpenAlex provides broad and valuable coverage of the global research landscape, it—like all bibliographic datasets—has inherent limitations. These include incomplete records, variations in author disambiguation, differences in journal indexing, and delays in data updates. As a result, some metrics and network relationships displayed in Rankless may not fully capture the entirety of a scholar's output or impact.

Explore authors with similar magnitude of impact