Algorithmen zum Auffinden längster Kreise in Graphen. - Ingo Schiermeyer (1988)

A Fast Sequential and Parallel Algorithm for the Computation of the k-Closure of a Graph. - Ingo Schiermeyer (WG, 1989)

Solving 3-Satisfiability in Less Then 1, 579n Steps. - Ingo Schiermeyer (CSL, 1992)

Deciding 3-Colourability in Less Than O(1.415^n) Steps. - Ingo Schiermeyer (WG, 1993)

Computation of the 0-dual closure for hamiltonian graphs. - Ingo Schiermeyer (Discret. Math., 1993)

Reverse-Fit: A 2-Optimal Algorithm for Packing Rectangles. - Ingo Schiermeyer (ESA, 1994)

Subgraphs, Closures and Hamiltonicity. - Hajo Broersma; Ingo Schiermeyer (Discret. Appl. Math., 1994)

A closure concept based on neighborhood unions of independent triples. - Haitze J. Broersma; Ingo Schiermeyer (Discret. Math., 1994)

The k-Satisfiability problem remains NP-complete for dense families. - Ingo Schiermeyer (Discret. Math., 1994)

On Path-Tough Graphs. - Peter Dankelmann; Thomas Niessen; Ingo Schiermeyer (SIAM J. Discret. Math., 1994)

An Approximation Algorithm for 3-Colourability. - Ingo Schiermeyer (WG, 1995)

On the independence number in K1, r+1-free graphs. - Zdenek Ryjácek; Ingo Schiermeyer (Discret. Math., 1995)

The flower conjecture in special classes of graphs. - Zdenek Ryjácek; Ingo Schiermeyer (Discuss. Math. Graph Theory, 1995)

Problems remaining NP-complette for sparse or dense graphs. - Ingo Schiermeyer (Discuss. Math. Graph Theory, 1995)

Insertible vertices, neighborhood intersections, and hamiltonicity. - Ahmed Ainouche; Ingo Schiermeyer (J. Graph Theory, 1995)

Toughness and hamiltonicity in almost claw-free graphs. - Haitze J. Broersma; Zdenek Ryjácek; Ingo Schiermeyer (J. Graph Theory, 1996)

Local connectivity and cycle xtension in claw-free graphs. - Ralph J. Faudree; Zdenek Ryjácek; Ingo Schiermeyer (Ars Comb., 1997)

Ramsey Numbers r(K3, G) for Connected Graphs G of Order Seven. - Annette Schelten; Ingo Schiermeyer (Discret. Appl. Math., 1997)

Small Cycles in Hamiltonian Graphs. - Uwe Schelten; Ingo Schiermeyer (Discret. Appl. Math., 1997)

Dirac's minimum degree condition restricted to claws. - Haitze J. Broersma; Zdenek Ryjácek; Ingo Schiermeyer (Discret. Math., 1997)

On the computational complexity of (O, P)-partition problems. - Jan Kratochvíl; Ingo Schiermeyer (Discuss. Math. Graph Theory, 1997)

Approximating Maximum Independent Set in k-Clique-Free Graphs. - Ingo Schiermeyer (APPROX, 1998)

A planarity criterion for cubic bipartite graphs. - Thomas Böhme 001; Jochen Harant; Anja Pruchnewski; Ingo Schiermeyer (Discret. Math., 1998)

2-factors and hamiltonicity. - Zdenek Ryjácek; Ingo Schiermeyer (Discret. Math., 1998)

Ramsey numbers r(K3, G) for G = K7 - 2P2 and G = K7 - 3P2. - Annette Schelten; Ingo Schiermeyer (Discret. Math., 1998)

Linear und exponentiell wachsende Kaninchenpopulationen. - Ingo Schiermeyer (Angewandte Mathematik, insbesondere Informatik, 1999)

Forbidden subgraphs, stability and hamiltonicity. - Jan Brousek; Zdenek Ryjácek; Ingo Schiermeyer (Discret. Math., 1999)

On quadrilaterals in a graph. - Bert Randerath; Ingo Schiermeyer; Hong Wang 005 (Discret. Math., 1999)

3-colored Ramsey Numbers of Odd Cycles. - Annette Schelten; Ingo Schiermeyer; Ralph J. Faudree (Electron. Notes Discret. Math., 1999)

On-line rankings of graphs. - Ingo Schiermeyer; Zsolt Tuza; Margit Voigt (Discret. Math., 2000)

Closure Concepts: A Survey. - Hajo Broersma; Zdenek Ryjácek; Ingo Schiermeyer (Graphs Comb., 2000)

On a Max-min Problem Concerning Weights of Edges. - Stanislav Jendrol'; Ingo Schiermeyer (Comb., 2001)

On the independence number of a graph in terms of order and size. - Jochen Harant; Ingo Schiermeyer (Discret. Math., 2001)

Colouring Graphs with Prescribed Induced Cycle Lengths. - Bert Randerath; Ingo Schiermeyer (Discuss. Math. Graph Theory, 2001)

On the stability for pancyclicity. - Ingo Schiermeyer (Discuss. Math. Graph Theory, 2001)

3-Colorability element oF P for p6-free Graphs. - Bert Randerath; Ingo Schiermeyer (Electron. Notes Discret. Math., 2001)

On weights of induced paths and cycles in claw-free and K1, r-free graphs. - Jochen Harant; Margit Voigt; Stanislav Jendrol'; Bert Randerath; Zdenek Ryjácek; Ingo Schiermeyer (J. Graph Theory, 2001)

A note on Brooks' theorem for triangle-free graphs. - Bert Randerath; Ingo Schiermeyer (Australas. J Comb., 2002)

Vertex pancyclic graphs. - Bert Randerath; Ingo Schiermeyer; Meike Tewes; Lutz Volkmann (Discret. Appl. Math., 2002)

Forbidden subgraphs implying the MIN-algorithm gives a maximum independent set. - Jochen Harant; Zdenek Ryjácek; Ingo Schiermeyer (Discret. Math., 2002)

Three-colourability and forbidden subgraphs. II: polynomial algorithms. - Bert Randerath; Ingo Schiermeyer; Meike Tewes (Discret. Math., 2002)

Preface. - Jochen Harant; Ingo Schiermeyer; Margit Voigt (Discuss. Math. Graph Theory, 2002)

Longest Paths and Longest Cycles in Graphs with Large Degree Sums. - Ingo Schiermeyer; Meike Tewes (Graphs Comb., 2002)

The Ramsey number r(C7, C7, C7). - Ralph J. Faudree; Annette Schelten; Ingo Schiermeyer (Discuss. Math. Graph Theory, 2003)

0-Dual Closures for Several Classes of Graphs. - Ahmed Ainouche; Ingo Schiermeyer (Graphs Comb., 2003)

Two-factors each component of which contains a specified vertex. - Yoshimi Egawa; Hikoe Enomoto; Ralph J. Faudree; Hao Li 002; Ingo Schiermeyer (J. Graph Theory, 2003)

Degree conditions for k-ordered hamiltonian graphs. - Ralph J. Faudree; Ronald J. Gould; Alexandr V. Kostochka; Linda M. Lesniak; Ingo Schiermeyer; Akira Saito (J. Graph Theory, 2003)

All cycle-complete graph Ramsey numbers r(Cm, K6). - Ingo Schiermeyer (J. Graph Theory, 2003)

3-Colorability in P for P6-free graphs. - Bert Randerath; Ingo Schiermeyer (Discret. Appl. Math., 2004)

Cycle lengths and chromatic number of graphs. - Peter Mihók; Ingo Schiermeyer (Discret. Math., 2004)

Rainbow numbers for matchings and complete graphs. - Ingo Schiermeyer (Discret. Math., 2004)

Vertex Colouring and Forbidden Subgraphs - A Survey. - Bert Randerath; Ingo Schiermeyer (Graphs Comb., 2004)

Ramsey (K1,2,K3)-Minimal Graphs. - Mieczyslaw Borowiecki; Ingo Schiermeyer; Elzbieta Sidorowicz (Electron. J. Comb., 2005)

An Asymptotic Result for the Path Partition Conjecture. - Marietjie Frick; Ingo Schiermeyer (Electron. J. Comb., 2005)

The Cycle-Complete Graph Ramsey Number r(C5, K7). - Ingo Schiermeyer (Discuss. Math. Graph Theory, 2005)

Chvátal-Erdös condition and pancyclism. - Evelyne Flandrin; Hao Li 002; Antoni Marczyk; Ingo Schiermeyer; Mariusz Wozniak (Discuss. Math. Graph Theory, 2006)

A lower bound on the independence number of a graph in terms of degrees. - Jochen Harant; Ingo Schiermeyer (Discuss. Math. Graph Theory, 2006)

Upper bounds for the chromatic number of a graph. - Ingo Schiermeyer (Electron. Notes Discret. Math., 2006)

Extremal Problems for Imbalanced Edges. - Dieter Rautenbach; Ingo Schiermeyer (Graphs Comb., 2006)

Independence number and vertex-disjoint cycles. - Yoshimi Egawa; Hikoe Enomoto; Stanislav Jendrol'; Katsuhiro Ota; Ingo Schiermeyer (Discret. Math., 2007)

Degree conditions for hamiltonicity: Counting the number of missing edges. - Ralph J. Faudree; Richard H. Schelp; Akira Saito; Ingo Schiermeyer (Discret. Math., 2007)

Chvátal Erdós condition and 2-factors with a specyfied number of components. - Guantao Chen; Ronald J. Gould; Ken-ichi Kawarabayashi; Katsuhiro Ota; Akira Saito; Ingo Schiermeyer (Discuss. Math. Graph Theory, 2007)

A new upper bound for the chromatic number of a graph. - Ingo Schiermeyer (Discuss. Math. Graph Theory, 2007)

New sufficient conditions for hamiltonian and pancyclic graphs. - Ingo Schiermeyer; Mariusz Wozniak (Discuss. Math. Graph Theory, 2007)

Rainbows in the Hypercube. - Maria Axenovich; Heiko Harborth; Arnfried Kemnitz; Meinhard Möller; Ingo Schiermeyer (Graphs Comb., 2007)

On the complexity of 4-coloring graphs without long induced paths. - Van Bang Le; Bert Randerath; Ingo Schiermeyer (Theor. Comput. Sci., 2007)

Efficiency in exponential time for domination-type problems. - Ingo Schiermeyer (Discret. Appl. Math., 2008)

The independence number in graphs of maximum degree three. - Jochen Harant; Michael A. Henning; Dieter Rautenbach; Ingo Schiermeyer (Discret. Math., 2008)

Non-path spectrum sets. - Guantao Chen; Ralph J. Faudree; Xuechao Li; Ingo Schiermeyer (J. Graph Theory, 2008)

Rainbow Connection in Graphs with Minimum Degree Three. - Ingo Schiermeyer (IWOCA, 2009)

A Rainbow k-Matching in the Complete Graph with r Colors. - Shinya Fujita 001; Atsushi Kaneko; Ingo Schiermeyer; Kazuhiro Suzuki (Electron. J. Comb., 2009)

Colourings of graphs with two consecutive odd cycle lengths. - Stephan Matos Camacho; Ingo Schiermeyer (Discret. Math., 2009)

On the circumference of a graph and its complement. - Ralph J. Faudree; Linda M. Lesniak; Ingo Schiermeyer (Discret. Math., 2009)

On F-independence in graphs. - Frank Göring; Jochen Harant; Dieter Rautenbach; Ingo Schiermeyer (Discuss. Math. Graph Theory, 2009)

Progress on Rainbow Connection. - Ingo Schiermeyer (CTW, 2010)

Random Procedures for Dominating Sets in Graphs. - Sarah Artmann; Frank Göring; Jochen Harant; Dieter Rautenbach; Ingo Schiermeyer (Electron. J. Comb., 2010)

On maximum independent sets in P5-free graphs. - Bert Randerath; Ingo Schiermeyer (Discret. Appl. Math., 2010)

Approximation algorithms for the minimum rainbow subgraph problem. - Stephan Matos Camacho; Ingo Schiermeyer; Zsolt Tuza (Discret. Math., 2010)

Packing disjoint cycles over vertex cuts. - Jochen Harant; Dieter Rautenbach; Peter Recht; Ingo Schiermeyer; Eva-Maria Sprengel (Discret. Math., 2010)

Some results on Reed's Conjecture about omega, Delta, and chi with respect to alpha. - Anja Kohl; Ingo Schiermeyer (Discret. Math., 2010)

Structural Properties and Hamiltonicity of Neighborhood Graphs. - Ingo Schiermeyer; Martin Sonntag; Hanns-Martin Teichert (Graphs Comb., 2010)

Cycle length parities and the chromatic number. - Christian Löwenstein; Dieter Rautenbach; Ingo Schiermeyer (J. Graph Theory, 2010)

A pair of forbidden subgraphs and perfect matchings in graphs of high connectivity. - Jun Fujisawa; Shinya Fujita 001; Michael D. Plummer; Akira Saito; Ingo Schiermeyer (Comb., 2011)

A New Bound on the Domination Number of Graphs with Minimum Degree Two. - Michael A. Henning; Ingo Schiermeyer; Anders Yeo (Electron. J. Comb., 2011)

Closure for spanning trees and distant area. - Jun Fujisawa; Akira Saito; Ingo Schiermeyer (Discuss. Math. Graph Theory, 2011)

Graphs with rainbow connection number two. - Arnfried Kemnitz; Ingo Schiermeyer (Discuss. Math. Graph Theory, 2011)

Bounds for the rainbow connection number of graphs. - Ingo Schiermeyer (Discuss. Math. Graph Theory, 2011)

Algorithmic approaches for the minimum rainbow subgraph problem. - Maria Koch; Stephan Matos Camacho; Ingo Schiermeyer (Electron. Notes Discret. Math., 2011)

Improved approximation bounds for the minimum rainbow subgraph problem. - Ján Katrenic; Ingo Schiermeyer (Inf. Process. Lett., 2011)

On computing the minimum 3-path vertex cover and dissociation number of graphs. - Frantisek Kardos; Ján Katrenic; Ingo Schiermeyer (Theor. Comput. Sci., 2011)

A Dirac theorem for trestles. - Stanislav Jendrol'; Tomás Kaiser; Zdenek Ryjácek; Ingo Schiermeyer (Discret. Math., 2012)

Improved degree conditions for Hamiltonian properties. - Arnfried Kemnitz; Ingo Schiermeyer (Discret. Math., 2012)

Dense Arbitrarily Vertex Decomposable Graphs. - Mirko Hornák; Antoni Marczyk; Ingo Schiermeyer; Mariusz Wozniak (Graphs Comb., 2012)

Closures, cycles, and paths. - Jochen Harant; Arnfried Kemnitz; Akira Saito; Ingo Schiermeyer (J. Graph Theory, 2012)

On the minimum rainbow subgraph number of a graph. - Ingo Schiermeyer (Ars Math. Contemp., 2013)

On minimally rainbow k-connected graphs. - Ingo Schiermeyer (Discret. Appl. Math., 2013)

Rainbow connection and minimum degree. - Ingo Schiermeyer (Discret. Appl. Math., 2013)

The rainbow connection number of 2-connected graphs. - Jan Ekstein; Premysl Holub; Tomás Kaiser; Maria Koch; Stephan Matos Camacho; Zdenek Ryjácek; Ingo Schiermeyer (Discret. Math., 2013)

On maximum weight of a bipartite graph of given order and size. - Mirko Hornák; Stanislav Jendrol'; Ingo Schiermeyer (Discuss. Math. Graph Theory, 2013)

Rainbow connection in sparse graphs. - Arnfried Kemnitz; Jakub Przybylo; Ingo Schiermeyer; Mariusz Wozniak (Discuss. Math. Graph Theory, 2013)

Rainbow connection number of dense graphs. - Xueliang Li 001; Mengmeng Liu; Ingo Schiermeyer (Discuss. Math. Graph Theory, 2013)

Rainbow connection in oriented graphs. - Paul Dorbec; Ingo Schiermeyer; Elzbieta Sidorowicz; Éric Sopena (Discret. Appl. Math., 2014)

Rainbow numbers for matchings in plane triangulations. - Stanislav Jendrol'; Ingo Schiermeyer; Jianhua Tu (Discret. Math., 2014)

The Maximum Independent Set Problem in Subclasses of Subcubic Graphs. - Christoph Brause; Ngoc Chi Lê; Ingo Schiermeyer (Discret. Math., 2015)

On forbidden subgraphs and rainbow connection in graphs with minimum degree 2. - Premysl Holub; Zdenek Ryjácek; Ingo Schiermeyer (Discret. Math., 2015)

Rainbow connection and forbidden subgraphs. - Premysl Holub; Zdenek Ryjácek; Ingo Schiermeyer; Petr Vrána (Discret. Math., 2015)

New sufficient conditions for α-redundant vertices. - Ngoc Chi Lê; Christoph Brause; Ingo Schiermeyer (Discret. Math., 2015)

Extending the Max Algorithm for maximum independent set. - Christoph Brause; Ngoc Chi Lê; Ingo Schiermeyer (Discuss. Math. Graph Theory, 2015)

Graphs with 3-rainbow index n-1 and n-2. - Xueliang Li 001; Ingo Schiermeyer; Kang Yang; Yan Zhao 013 (Discuss. Math. Graph Theory, 2015)

Graphs with 4-rainbow index 3 and n-1. - Xueliang Li 001; Ingo Schiermeyer; Kang Yang; Yan Zhao 013 (Discuss. Math. Graph Theory, 2015)

4-colorability of P6-free graphs. - Christoph Brause; Ingo Schiermeyer; Premysl Holub; Zdenek Ryjácek; Petr Vrána; Rastislav Krivos-Bellus (Electron. Notes Discret. Math., 2015)

The Maximum Independent Set Problem in Subclasses of Si, j, k-Free Graphs. - Ngoc Chi Lê; Christoph Brause; Ingo Schiermeyer (Electron. Notes Discret. Math., 2015)

Hypohamiltonian Oriented Graphs of All Possible Orders. - Susan A. van Aardt; Alewyn P. Burger; Marietjie Frick; Arnfried Kemnitz; Ingo Schiermeyer (Graphs Comb., 2015)

Rainbow Numbers for Graphs Containing Small Cycles. - Ingo Schiermeyer; Roman Soták (Graphs Comb., 2015)

Rainbow Numbers for Cycles in Plane Triangulations. - Mirko Hornák; Stanislav Jendrol'; Ingo Schiermeyer; Roman Soták (J. Graph Theory, 2015)

A lower bound on the independence number of a graph in terms of degrees and local clique sizes. - Christoph Brause; Bert Randerath; Dieter Rautenbach; Ingo Schiermeyer (Discret. Appl. Math., 2016)

Sufficient conditions for 2-rainbow connected graphs. - Arnfried Kemnitz; Ingo Schiermeyer (Discret. Appl. Math., 2016)

Kernelization of the 3-path vertex cover problem. - Christoph Brause; Ingo Schiermeyer (Discret. Math., 2016)

Characterizing forbidden pairs for rainbow connection in graphs with minimum degree 2. - Premysl Holub; Zdenek Ryjácek; Ingo Schiermeyer; Petr Vrána (Discret. Math., 2016)

On the maximum weight of a dense connected graph of given order and size. - Mirko Hornák; Stanislav Jendrol'; Ingo Schiermeyer (Discret. Math., 2016)

Chromatic number of P5-free graphs: Reed's conjecture. - Ingo Schiermeyer (Discret. Math., 2016)

Dense arbitrarily partitionable graphs. - Rafal Kalinowski; Monika Pilsniak; Ingo Schiermeyer; Mariusz Wozniak (Discuss. Math. Graph Theory, 2016)

Proper connection number 2, connectivity, and forbidden subgraphs. - Christoph Brause; Trung Duy Doan; Ingo Schiermeyer (Electron. Notes Discret. Math., 2016)

On the minimum degree and the proper connection number of graphs. - Christoph Brause; Trung Duy Doan; Ingo Schiermeyer (Electron. Notes Discret. Math., 2016)

On the chromatic number of (P5, K2, t)-free graphs. - Christoph Brause; Trung Duy Doan; Ingo Schiermeyer (Electron. Notes Discret. Math., 2016)

On the Maximum Weight of a Sparse Connected Graph of Given Order and Size. - Mirko Hornák; Stanislav Jendrol'; Ingo Schiermeyer (Graphs Comb., 2016)

On Star-Wheel Ramsey Numbers. - Binlong Li; Ingo Schiermeyer (Graphs Comb., 2016)

Proper connection and size of graphs. - Susan A. van Aardt; Christoph Brause; Alewyn P. Burger; Marietjie Frick; Arnfried Kemnitz; Ingo Schiermeyer (Discret. Math., 2017)

Local connectivity, local degree conditions, some forbidden induced subgraphs, and cycle extendability. - Christoph Brause; Dieter Rautenbach; Ingo Schiermeyer (Discret. Math., 2017)

On sequential heurestic methods for the maximum independent set problem. - Christoph Brause; Ngoc Chi Lê; Ingo Schiermeyer (Discuss. Math. Graph Theory, 2017)

Minimum Degree Conditions for the Proper Connection Number of Graphs. - Christoph Brause; Trung Duy Doan; Ingo Schiermeyer (Graphs Comb., 2017)

On upper bounds for the independent transversal domination number. - Christoph Brause; Michael A. Henning; Kenta Ozeki; Ingo Schiermeyer; Elkin Vumar (Discret. Appl. Math., 2018)

Odd connection and odd vertex-connection of graphs. - Christoph Brause; Stanislav Jendrol'; Ingo Schiermeyer (Discret. Math., 2018)

Graphs with Conflict-Free Connection Number Two. - Hong Chang 002; Trung Duy Doan; Zhong Huang; Stanislav Jendrol'; Xueliang Li 001; Ingo Schiermeyer (Graphs Comb., 2018)

On the chromatic number of 2K2-free graphs. - Christoph Brause; Bert Randerath; Ingo Schiermeyer; Elkin Vumar (Discret. Appl. Math., 2019)

Maximum independent sets near the upper bound. - Ingo Schiermeyer (Discret. Appl. Math., 2019)

On forbidden induced subgraphs for K1, 3-free perfect graphs. - Christoph Brause; Premysl Holub; Adam Kabela; Zdenek Ryjácek; Ingo Schiermeyer; Petr Vrána (Discret. Math., 2019)

Polynomial χ -Binding Functions and Forbidden Induced Subgraphs: A Survey. - Ingo Schiermeyer; Bert Randerath (Graphs Comb., 2019)

Ramsey and Gallai-Ramsey numbers for stars with extra independent edges. - Yaping Mao; Zhao Wang 007; Colton Magnant; Ingo Schiermeyer (Discret. Appl. Math., 2020)

Gallai-Ramsey number for K 4. - Henry Liu; Colton Magnant; Akira Saito; Ingo Schiermeyer; Yongtang Shi (J. Graph Theory, 2020)

Conflict-free vertex connection number at most 3 and size of graphs. - Trung Duy Doan; Ingo Schiermeyer (Discuss. Math. Graph Theory, 2021)

Proper rainbow connection number of graphs. - Trung Duy Doan; Ingo Schiermeyer (Discuss. Math. Graph Theory, 2021)

From Colourful to Rainbow Paths in Graphs: Colouring the Vertices. - Christoph Brause; Stanislav Jendrol'; Ingo Schiermeyer (Graphs Comb., 2021)

Conflict-Free Connection Number and Size of Graphs. - Trung Duy Doan; Ingo Schiermeyer (Graphs Comb., 2021)

Homogeneous sets, clique-separators, critical graphs, and optimal χ-binding functions. - Christoph Brause; Maximilian Geißer; Ingo Schiermeyer (Discret. Appl. Math., 2022)

The proper 2-connection number and size of graphs. - Trung Duy Doan; Ingo Schiermeyer (Discret. Appl. Math., 2022)

Forbidden induced subgraphs for perfectness of claw-free graphs of independence number at least 4. - Christoph Brause; Trung Duy Doan; Premysl Holub; Adam Kabela; Zdenek Ryjácek; Ingo Schiermeyer; Petr Vrána (Discret. Math., 2022)

The Conflict-Free Vertex-Connection Number and Degree Conditions of Graphs. - Trung Duy Doan; Pham Hoang Ha; Ingo Schiermeyer (Graphs Comb., 2022)

Ramsey and Gallai-Ramsey Number for Wheels. - Yaping Mao; Zhao Wang 007; Colton Magnant; Ingo Schiermeyer (Graphs Comb., 2022)

Gallai-Ramsey number for K 5 ${K}_{5}$. - Colton Magnant; Ingo Schiermeyer (J. Graph Theory, 2022)

Gallai-Ramsey numbers for fans. - Yaping Mao; Zhao Wang 007; Colton Magnant; Ingo Schiermeyer (Discret. Math., 2023)

Loose Edge-Connection of Graphs. - Christoph Brause; Stanislav Jendrol'; Ingo Schiermeyer (Graphs Comb., 2023)

The conflict-free connection number and the minimum degree-sum of graphs. - Trung Duy Doan; Thi Thanh Chau Do; Pham Hoang Ha; Ngoc Diep Pham; Ingo Schiermeyer (Appl. Math. Comput., 2024)

Graphs with large (1,2)-rainbow connection numbers. - Trung Duy Doan; Thi Thanh Chau Do; Ingo Schiermeyer (Appl. Math. Comput., 2024)

The proper 2-connection number of several graph classes. - Christoph Brause; Trung Duy Doan; Ingo Schiermeyer (Discret. Appl. Math., 2024)

Complete bipartite graphs without small rainbow subgraphs. - Zhiqiang Ma; Yaping Mao; Ingo Schiermeyer; Meiqin Wei (Discret. Appl. Math., 2024)

Compatible Spanning Circuits and Forbidden Induced Subgraphs. - Zhiwei Guo; Christoph Brause; Maximilian Geißer; Ingo Schiermeyer (Graphs Comb., 2024)

Gallai-Ramsey Numbers for Paths. - Ping Li 025; Yaping Mao; Ingo Schiermeyer; Yifan Yao (Graphs Comb., 2024)