Ingo Schiermeyer

ORCID

Publication Activity (10 Years)

Years Active: 1989-2024
Publications (10 Years): 50

Top Venues

Discret. Math.

Graphs Comb.

Discret. Appl. Math.

Discuss. Math. Graph Theory

RWTH Aachen University, Germany (PHD)

Education History

RWTH Aachen University, Germany

PHD

Publications

Zhiwei Guo, Christoph Brause, Maximilian Geißer, Ingo Schiermeyer
Compatible Spanning Circuits and Forbidden Induced Subgraphs. Graphs Comb. 40 (1) (2024)
Yaping Mao, Zhao Wang, Colton Magnant, Ingo Schiermeyer
Gallai-Ramsey numbers for fans. Discret. Math. 346 (5) (2023)
Christoph Brause, Stanislav Jendrol', Ingo Schiermeyer
Loose Edge-Connection of Graphs. Graphs Comb. 39 (4) (2023)
Colton Magnant, Ingo Schiermeyer
Gallai-Ramsey number for K 5 ${K}_{5}$. J. Graph Theory 101 (3) (2022)
Yaping Mao, Zhao Wang, Colton Magnant, Ingo Schiermeyer
Ramsey and Gallai-Ramsey Number for Wheels. Graphs Comb. 38 (2) (2022)
Trung Duy Doan, Pham Hoang Ha, Ingo Schiermeyer
The Conflict-Free Vertex-Connection Number and Degree Conditions of Graphs. Graphs Comb. 38 (5) (2022)
Christoph Brause, Trung Duy Doan, Premysl Holub, Adam Kabela, Zdenek Ryjácek, Ingo Schiermeyer, Petr Vrána
Forbidden induced subgraphs for perfectness of claw-free graphs of independence number at least 4. Discret. Math. 345 (6) (2022)
Christoph Brause, Maximilian Geißer, Ingo Schiermeyer
Homogeneous sets, clique-separators, critical graphs, and optimal χ-binding functions. Discret. Appl. Math. 320 (2022)
Trung Duy Doan, Ingo Schiermeyer
The proper 2-connection number and size of graphs. Discret. Appl. Math. 320 (2022)
Christoph Brause, Stanislav Jendrol', Ingo Schiermeyer
From Colourful to Rainbow Paths in Graphs: Colouring the Vertices. Graphs Comb. 37 (5) (2021)
Trung Duy Doan, Ingo Schiermeyer
Conflict-free vertex connection number at most 3 and size of graphs. Discuss. Math. Graph Theory 41 (2) (2021)
Trung Duy Doan, Ingo Schiermeyer
Proper rainbow connection number of graphs. Discuss. Math. Graph Theory 41 (3) (2021)
Trung Duy Doan, Ingo Schiermeyer
Conflict-Free Connection Number and Size of Graphs. Graphs Comb. 37 (5) (2021)
Yaping Mao, Zhao Wang, Colton Magnant, Ingo Schiermeyer
Ramsey and Gallai-Ramsey numbers for stars with extra independent edges. Discret. Appl. Math. 285 (2020)
Henry Liu, Colton Magnant, Akira Saito, Ingo Schiermeyer, Yongtang Shi
Gallai-Ramsey number for K 4. J. Graph Theory 94 (2) (2020)
Christoph Brause, Premysl Holub, Adam Kabela, Zdenek Ryjácek, Ingo Schiermeyer, Petr Vrána
On forbidden induced subgraphs for K1, 3-free perfect graphs. Discret. Math. 342 (6) (2019)
Ingo Schiermeyer
Maximum independent sets near the upper bound. Discret. Appl. Math. 266 (2019)
Christoph Brause, Bert Randerath, Ingo Schiermeyer, Elkin Vumar
On the chromatic number of 2K2-free graphs. Discret. Appl. Math. 253 (2019)
Ingo Schiermeyer, Bert Randerath
Polynomial χ -Binding Functions and Forbidden Induced Subgraphs: A Survey. Graphs Comb. 35 (1) (2019)
Hong Chang, Trung Duy Doan, Zhong Huang, Stanislav Jendrol', Xueliang Li, Ingo Schiermeyer
Graphs with Conflict-Free Connection Number Two. Graphs Comb. 34 (6) (2018)
Christoph Brause, Michael A. Henning, Kenta Ozeki, Ingo Schiermeyer, Elkin Vumar
On upper bounds for the independent transversal domination number. Discret. Appl. Math. 236 (2018)
Christoph Brause, Stanislav Jendrol', Ingo Schiermeyer
Odd connection and odd vertex-connection of graphs. Discret. Math. 341 (12) (2018)
Christoph Brause, Dieter Rautenbach, Ingo Schiermeyer
Local connectivity, local degree conditions, some forbidden induced subgraphs, and cycle extendability. Discret. Math. 340 (4) (2017)
Susan A. van Aardt, Christoph Brause, Alewyn P. Burger, Marietjie Frick, Arnfried Kemnitz, Ingo Schiermeyer
Proper connection and size of graphs. Discret. Math. 340 (11) (2017)
Christoph Brause, Ngoc Chi Lê, Ingo Schiermeyer
On sequential heurestic methods for the maximum independent set problem. Discuss. Math. Graph Theory 37 (2) (2017)
Christoph Brause, Trung Duy Doan, Ingo Schiermeyer
Minimum Degree Conditions for the Proper Connection Number of Graphs. Graphs Comb. 33 (4) (2017)
Arnfried Kemnitz, Ingo Schiermeyer
Sufficient conditions for 2-rainbow connected graphs. Discret. Appl. Math. 209 (2016)
Binlong Li, Ingo Schiermeyer
On Star-Wheel Ramsey Numbers. Graphs Comb. 32 (2) (2016)
Ingo Schiermeyer
-free graphs: Reed's conjecture. Discret. Math. 339 (7) (2016)
Mirko Hornák, Stanislav Jendrol', Ingo Schiermeyer
On the Maximum Weight of a Sparse Connected Graph of Given Order and Size. Graphs Comb. 32 (3) (2016)
Christoph Brause, Trung Duy Doan, Ingo Schiermeyer
)-free graphs. Electron. Notes Discret. Math. 55 (2016)
Premysl Holub, Zdenek Ryjácek, Ingo Schiermeyer, Petr Vrána
Characterizing forbidden pairs for rainbow connection in graphs with minimum degree 2. Discret. Math. 339 (2) (2016)
Christoph Brause, Trung Duy Doan, Ingo Schiermeyer
On the minimum degree and the proper connection number of graphs. Electron. Notes Discret. Math. 55 (2016)
Christoph Brause, Trung Duy Doan, Ingo Schiermeyer
Proper connection number 2, connectivity, and forbidden subgraphs. Electron. Notes Discret. Math. 55 (2016)
Rafal Kalinowski, Monika Pilsniak, Ingo Schiermeyer, Mariusz Wozniak
Dense arbitrarily partitionable graphs. Discuss. Math. Graph Theory 36 (1) (2016)
Christoph Brause, Bert Randerath, Dieter Rautenbach, Ingo Schiermeyer
A lower bound on the independence number of a graph in terms of degrees and local clique sizes. Discret. Appl. Math. 209 (2016)
Mirko Hornák, Stanislav Jendrol', Ingo Schiermeyer
On the maximum weight of a dense connected graph of given order and size. Discret. Math. 339 (7) (2016)
Christoph Brause, Ingo Schiermeyer
Kernelization of the 3-path vertex cover problem. Discret. Math. 339 (7) (2016)
Premysl Holub, Zdenek Ryjácek, Ingo Schiermeyer, Petr Vrána
Rainbow connection and forbidden subgraphs. Discret. Math. 338 (10) (2015)
Susan A. van Aardt, Alewyn P. Burger, Marietjie Frick, Arnfried Kemnitz, Ingo Schiermeyer
Hypohamiltonian Oriented Graphs of All Possible Orders. Graphs Comb. 31 (6) (2015)
Ingo Schiermeyer, Roman Soták
Rainbow Numbers for Graphs Containing Small Cycles. Graphs Comb. 31 (6) (2015)
Christoph Brause, Ingo Schiermeyer, Premysl Holub, Zdenek Ryjácek, Petr Vrána, Rastislav Krivos-Bellus
-free graphs. Electron. Notes Discret. Math. 49 (2015)
Xueliang Li, Ingo Schiermeyer, Kang Yang, Yan Zhao
-2. Discuss. Math. Graph Theory 35 (1) (2015)
Ngoc Chi Lê, Christoph Brause, Ingo Schiermeyer
-Free Graphs. Electron. Notes Discret. Math. 49 (2015)
Mirko Hornák, Stanislav Jendrol', Ingo Schiermeyer, Roman Soták
Rainbow Numbers for Cycles in Plane Triangulations. J. Graph Theory 78 (4) (2015)
Premysl Holub, Zdenek Ryjácek, Ingo Schiermeyer
On forbidden subgraphs and rainbow connection in graphs with minimum degree 2. Discret. Math. 338 (3) (2015)
Ngoc Chi Lê, Christoph Brause, Ingo Schiermeyer
New sufficient conditions for α-redundant vertices. Discret. Math. 338 (10) (2015)
Christoph Brause, Ngoc Chi Lê, Ingo Schiermeyer
Extending the Max Algorithm for maximum independent set. Discuss. Math. Graph Theory 35 (2) (2015)
Christoph Brause, Ngoc Chi Lê, Ingo Schiermeyer
The Maximum Independent Set Problem in Subclasses of Subcubic Graphs. Discret. Math. 338 (10) (2015)
Xueliang Li, Ingo Schiermeyer, Kang Yang, Yan Zhao
-1. Discuss. Math. Graph Theory 35 (2) (2015)
Paul Dorbec, Ingo Schiermeyer, Elzbieta Sidorowicz, Éric Sopena
Rainbow connection in oriented graphs. Discret. Appl. Math. 179 (2014)
Stanislav Jendrol', Ingo Schiermeyer, Jianhua Tu
Rainbow numbers for matchings in plane triangulations. Discret. Math. 331 (2014)
Arnfried Kemnitz, Jakub Przybylo, Ingo Schiermeyer, Mariusz Wozniak
Rainbow connection in sparse graphs. Discuss. Math. Graph Theory 33 (1) (2013)
Jan Ekstein, Premysl Holub, Tomás Kaiser, Maria Koch, Stephan Matos Camacho, Zdenek Ryjácek, Ingo Schiermeyer
The rainbow connection number of 2-connected graphs. Discret. Math. 313 (19) (2013)
Mirko Hornák, Stanislav Jendrol', Ingo Schiermeyer
On maximum weight of a bipartite graph of given order and size. Discuss. Math. Graph Theory 33 (1) (2013)
Xueliang Li, Mengmeng Liu, Ingo Schiermeyer
Rainbow connection number of dense graphs. Discuss. Math. Graph Theory 33 (3) (2013)
Ingo Schiermeyer
Rainbow connection and minimum degree. Discret. Appl. Math. 161 (12) (2013)
Ingo Schiermeyer
-connected graphs. Discret. Appl. Math. 161 (4-5) (2013)
Ingo Schiermeyer
On the minimum rainbow subgraph number of a graph. Ars Math. Contemp. 6 (1) (2013)
Mirko Hornák, Antoni Marczyk, Ingo Schiermeyer, Mariusz Wozniak
Dense Arbitrarily Vertex Decomposable Graphs. Graphs Comb. 28 (6) (2012)
Stanislav Jendrol', Tomás Kaiser, Zdenek Ryjácek, Ingo Schiermeyer
A Dirac theorem for trestles. Discret. Math. 312 (12-13) (2012)
Arnfried Kemnitz, Ingo Schiermeyer
Improved degree conditions for Hamiltonian properties. Discret. Math. 312 (14) (2012)
Jochen Harant, Arnfried Kemnitz, Akira Saito, Ingo Schiermeyer
Closures, cycles, and paths. J. Graph Theory 69 (3) (2012)
Ingo Schiermeyer
Bounds for the rainbow connection number of graphs. Discuss. Math. Graph Theory 31 (2) (2011)
Arnfried Kemnitz, Ingo Schiermeyer
Graphs with rainbow connection number two. Discuss. Math. Graph Theory 31 (2) (2011)
Frantisek Kardos, Ján Katrenic, Ingo Schiermeyer
On computing the minimum 3-path vertex cover and dissociation number of graphs. Theor. Comput. Sci. 412 (50) (2011)
Ján Katrenic, Ingo Schiermeyer
Improved approximation bounds for the minimum rainbow subgraph problem. Inf. Process. Lett. 111 (3) (2011)
Maria Koch, Stephan Matos Camacho, Ingo Schiermeyer
Algorithmic approaches for the minimum rainbow subgraph problem. Electron. Notes Discret. Math. 38 (2011)
Michael A. Henning, Ingo Schiermeyer, Anders Yeo
A New Bound on the Domination Number of Graphs with Minimum Degree Two. Electron. J. Comb. 18 (1) (2011)
Jun Fujisawa, Shinya Fujita, Michael D. Plummer, Akira Saito, Ingo Schiermeyer
A pair of forbidden subgraphs and perfect matchings in graphs of high connectivity. Comb. 31 (6) (2011)
Jun Fujisawa, Akira Saito, Ingo Schiermeyer
Closure for spanning trees and distant area. Discuss. Math. Graph Theory 31 (1) (2011)
Stephan Matos Camacho, Ingo Schiermeyer, Zsolt Tuza
Approximation algorithms for the minimum rainbow subgraph problem. Discret. Math. 310 (20) (2010)
Bert Randerath, Ingo Schiermeyer
-free graphs. Discret. Appl. Math. 158 (9) (2010)
Anja Kohl, Ingo Schiermeyer
Some results on Reed's Conjecture about omega, Delta, and chi with respect to alpha. Discret. Math. 310 (9) (2010)
Jochen Harant, Dieter Rautenbach, Peter Recht, Ingo Schiermeyer, Eva-Maria Sprengel
Packing disjoint cycles over vertex cuts. Discret. Math. 310 (13-14) (2010)
Ingo Schiermeyer, Martin Sonntag, Hanns-Martin Teichert
Structural Properties and Hamiltonicity of Neighborhood Graphs. Graphs Comb. 26 (3) (2010)
Ingo Schiermeyer
Progress on Rainbow Connection. CTW (2010)
Sarah Artmann, Frank Göring, Jochen Harant, Dieter Rautenbach, Ingo Schiermeyer
Random Procedures for Dominating Sets in Graphs. Electron. J. Comb. 17 (1) (2010)
Christian Löwenstein, Dieter Rautenbach, Ingo Schiermeyer
Cycle length parities and the chromatic number. J. Graph Theory 64 (3) (2010)
Ralph J. Faudree, Linda M. Lesniak, Ingo Schiermeyer
On the circumference of a graph and its complement. Discret. Math. 309 (19) (2009)
Ingo Schiermeyer
Rainbow Connection in Graphs with Minimum Degree Three. IWOCA (2009)
Stephan Matos Camacho, Ingo Schiermeyer
Colourings of graphs with two consecutive odd cycle lengths. Discret. Math. 309 (15) (2009)
Shinya Fujita, Atsushi Kaneko, Ingo Schiermeyer, Kazuhiro Suzuki
A Rainbow k-Matching in the Complete Graph with r Colors. Electron. J. Comb. 16 (1) (2009)
Frank Göring, Jochen Harant, Dieter Rautenbach, Ingo Schiermeyer
-independence in graphs. Discuss. Math. Graph Theory 29 (2) (2009)
Ingo Schiermeyer
Efficiency in exponential time for domination-type problems. Discret. Appl. Math. 156 (17) (2008)
Jochen Harant, Michael A. Henning, Dieter Rautenbach, Ingo Schiermeyer
The independence number in graphs of maximum degree three. Discret. Math. 308 (23) (2008)
Guantao Chen, Ralph J. Faudree, Xuechao Li, Ingo Schiermeyer
Non-path spectrum sets. J. Graph Theory 58 (4) (2008)
Ralph J. Faudree, Richard H. Schelp, Akira Saito, Ingo Schiermeyer
Degree conditions for hamiltonicity: Counting the number of missing edges. Discret. Math. 307 (7-8) (2007)
Maria Axenovich, Heiko Harborth, Arnfried Kemnitz, Meinhard Möller, Ingo Schiermeyer
Rainbows in the Hypercube. Graphs Comb. 23 (2) (2007)
Guantao Chen, Ronald J. Gould, Ken-ichi Kawarabayashi, Katsuhiro Ota, Akira Saito, Ingo Schiermeyer
Chvátal Erdós condition and 2-factors with a specyfied number of components. Discuss. Math. Graph Theory 27 (3) (2007)
Van Bang Le, Bert Randerath, Ingo Schiermeyer
On the complexity of 4-coloring graphs without long induced paths. Theor. Comput. Sci. 389 (1-2) (2007)
Ingo Schiermeyer
A new upper bound for the chromatic number of a graph. Discuss. Math. Graph Theory 27 (1) (2007)
Yoshimi Egawa, Hikoe Enomoto, Stanislav Jendrol', Katsuhiro Ota, Ingo Schiermeyer
Independence number and vertex-disjoint cycles. Discret. Math. 307 (11-12) (2007)
Ingo Schiermeyer, Mariusz Wozniak
New sufficient conditions for hamiltonian and pancyclic graphs. Discuss. Math. Graph Theory 27 (1) (2007)
Jochen Harant, Ingo Schiermeyer
A lower bound on the independence number of a graph in terms of degrees. Discuss. Math. Graph Theory 26 (3) (2006)
Ingo Schiermeyer
Upper bounds for the chromatic number of a graph. Electron. Notes Discret. Math. 25 (2006)
Evelyne Flandrin, Hao Li, Antoni Marczyk, Ingo Schiermeyer, Mariusz Wozniak
Chvátal-Erdös condition and pancyclism. Discuss. Math. Graph Theory 26 (2) (2006)
Dieter Rautenbach, Ingo Schiermeyer
Extremal Problems for Imbalanced Edges. Graphs Comb. 22 (1) (2006)
Marietjie Frick, Ingo Schiermeyer
An Asymptotic Result for the Path Partition Conjecture. Electron. J. Comb. 12 (2005)
Mieczyslaw Borowiecki, Ingo Schiermeyer, Elzbieta Sidorowicz
)-Minimal Graphs. Electron. J. Comb. 12 (2005)

Ingo Schiermeyer.css-eqlu8i{font-size:small;padding-left:4px;}

Publication Activity (10 Years)

Top Topics

Top Venues

Ingo Schiermeyer