Ingo Schiermeyer

Orcid: 0000-0002-9226-8025

According to our database1, Ingo Schiermeyer authored at least 157 papers between 1988 and 2024.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of two.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
Compatible Spanning Circuits and Forbidden Induced Subgraphs.
Graphs Comb., February, 2024

Complete bipartite graphs without small rainbow subgraphs.
Discret. Appl. Math., 2024

The proper 2-connection number of several graph classes.
Discret. Appl. Math., 2024

Graphs with large (1,2)-rainbow connection numbers.
Appl. Math. Comput., 2024

The conflict-free connection number and the minimum degree-sum of graphs.
Appl. Math. Comput., 2024

2023
Loose Edge-Connection of Graphs.
Graphs Comb., August, 2023

Gallai-Ramsey numbers for fans.
Discret. Math., May, 2023

2022
Gallai-Ramsey number for K 5 ${K}_{5}$.
J. Graph Theory, 2022

Ramsey and Gallai-Ramsey Number for Wheels.
Graphs Comb., 2022

The Conflict-Free Vertex-Connection Number and Degree Conditions of Graphs.
Graphs Comb., 2022

Forbidden induced subgraphs for perfectness of claw-free graphs of independence number at least 4.
Discret. Math., 2022

The proper 2-connection number and size of graphs.
Discret. Appl. Math., 2022

Homogeneous sets, clique-separators, critical graphs, and optimal χ-binding functions.
Discret. Appl. Math., 2022

2021
Conflict-Free Connection Number and Size of Graphs.
Graphs Comb., 2021

From Colourful to Rainbow Paths in Graphs: Colouring the Vertices.
Graphs Comb., 2021

Proper rainbow connection number of graphs.
Discuss. Math. Graph Theory, 2021

Conflict-free vertex connection number at most 3 and size of graphs.
Discuss. Math. Graph Theory, 2021

2020
Gallai-Ramsey number for K 4.
J. Graph Theory, 2020

Ramsey and Gallai-Ramsey numbers for stars with extra independent edges.
Discret. Appl. Math., 2020

2019
Polynomial χ -Binding Functions and Forbidden Induced Subgraphs: A Survey.
Graphs Comb., 2019

On forbidden induced subgraphs for K1, 3-free perfect graphs.
Discret. Math., 2019

Maximum independent sets near the upper bound.
Discret. Appl. Math., 2019

On the chromatic number of 2K2-free graphs.
Discret. Appl. Math., 2019

2018
Graphs with Conflict-Free Connection Number Two.
Graphs Comb., 2018

Odd connection and odd vertex-connection of graphs.
Discret. Math., 2018

On upper bounds for the independent transversal domination number.
Discret. Appl. Math., 2018

2017
Minimum Degree Conditions for the Proper Connection Number of Graphs.
Graphs Comb., 2017

On sequential heurestic methods for the maximum independent set problem.
Discuss. Math. Graph Theory, 2017

Local connectivity, local degree conditions, some forbidden induced subgraphs, and cycle extendability.
Discret. Math., 2017

Proper connection and size of graphs.
Discret. Math., 2017

2016
On Star-Wheel Ramsey Numbers.
Graphs Comb., 2016

On the Maximum Weight of a Sparse Connected Graph of Given Order and Size.
Graphs Comb., 2016

On the chromatic number of (P<sub>5</sub>, K<sub>2, t</sub>)-free graphs.
Electron. Notes Discret. Math., 2016

On the minimum degree and the proper connection number of graphs.
Electron. Notes Discret. Math., 2016

Proper connection number 2, connectivity, and forbidden subgraphs.
Electron. Notes Discret. Math., 2016

Dense arbitrarily partitionable graphs.
Discuss. Math. Graph Theory, 2016

Chromatic number of P<sub>5</sub>-free graphs: Reed's conjecture.
Discret. Math., 2016

On the maximum weight of a dense connected graph of given order and size.
Discret. Math., 2016

Characterizing forbidden pairs for rainbow connection in graphs with minimum degree 2.
Discret. Math., 2016

Kernelization of the 3-path vertex cover problem.
Discret. Math., 2016

Sufficient conditions for 2-rainbow connected graphs.
Discret. Appl. Math., 2016

A lower bound on the independence number of a graph in terms of degrees and local clique sizes.
Discret. Appl. Math., 2016

2015
Rainbow Numbers for Cycles in Plane Triangulations.
J. Graph Theory, 2015

Rainbow Numbers for Graphs Containing Small Cycles.
Graphs Comb., 2015

Hypohamiltonian Oriented Graphs of All Possible Orders.
Graphs Comb., 2015

The Maximum Independent Set Problem in Subclasses of S<sub>i, j, k</sub>-Free Graphs.
Electron. Notes Discret. Math., 2015

4-colorability of P<sub>6</sub>-free graphs.
Electron. Notes Discret. Math., 2015

Graphs with 4-rainbow index 3 and <i>n</i>-1.
Discuss. Math. Graph Theory, 2015

Graphs with 3-rainbow index <i>n</i>-1 and <i>n</i>-2.
Discuss. Math. Graph Theory, 2015

Extending the Max Algorithm for maximum independent set.
Discuss. Math. Graph Theory, 2015

New sufficient conditions for α-redundant vertices.
Discret. Math., 2015

Rainbow connection and forbidden subgraphs.
Discret. Math., 2015

On forbidden subgraphs and rainbow connection in graphs with minimum degree 2.
Discret. Math., 2015

The Maximum Independent Set Problem in Subclasses of Subcubic Graphs.
Discret. Math., 2015

2014
Rainbow numbers for matchings in plane triangulations.
Discret. Math., 2014

Rainbow connection in oriented graphs.
Discret. Appl. Math., 2014

2013
Rainbow connection number of dense graphs.
Discuss. Math. Graph Theory, 2013

Rainbow connection in sparse graphs.
Discuss. Math. Graph Theory, 2013

On maximum weight of a bipartite graph of given order and size.
Discuss. Math. Graph Theory, 2013

The rainbow connection number of 2-connected graphs.
Discret. Math., 2013

Rainbow connection and minimum degree.
Discret. Appl. Math., 2013

On minimally rainbow <i>k</i>-connected graphs.
Discret. Appl. Math., 2013

On the minimum rainbow subgraph number of a graph.
Ars Math. Contemp., 2013

2012
Closures, cycles, and paths.
J. Graph Theory, 2012

Dense Arbitrarily Vertex Decomposable Graphs.
Graphs Comb., 2012

Improved degree conditions for Hamiltonian properties.
Discret. Math., 2012

A Dirac theorem for trestles.
Discret. Math., 2012

2011
On computing the minimum 3-path vertex cover and dissociation number of graphs.
Theor. Comput. Sci., 2011

Improved approximation bounds for the minimum rainbow subgraph problem.
Inf. Process. Lett., 2011

Algorithmic approaches for the minimum rainbow subgraph problem.
Electron. Notes Discret. Math., 2011

Bounds for the rainbow connection number of graphs.
Discuss. Math. Graph Theory, 2011

Graphs with rainbow connection number two.
Discuss. Math. Graph Theory, 2011

Closure for spanning trees and distant area.
Discuss. Math. Graph Theory, 2011

A New Bound on the Domination Number of Graphs with Minimum Degree Two.
Electron. J. Comb., 2011

A pair of forbidden subgraphs and perfect matchings in graphs of high connectivity.
Comb., 2011

2010
Cycle length parities and the chromatic number.
J. Graph Theory, 2010

Structural Properties and Hamiltonicity of Neighborhood Graphs.
Graphs Comb., 2010

Some results on Reed's Conjecture about omega, Delta, and chi with respect to alpha.
Discret. Math., 2010

Packing disjoint cycles over vertex cuts.
Discret. Math., 2010

Approximation algorithms for the minimum rainbow subgraph problem.
Discret. Math., 2010

On maximum independent sets in P<sub>5</sub>-free graphs.
Discret. Appl. Math., 2010

Random Procedures for Dominating Sets in Graphs.
Electron. J. Comb., 2010

Progress on Rainbow Connection.
Proceedings of the 9th Cologne-Twente Workshop on Graphs and Combinatorial Optimization, 2010

2009
On <i> F</i>-independence in graphs.
Discuss. Math. Graph Theory, 2009

On the circumference of a graph and its complement.
Discret. Math., 2009

Colourings of graphs with two consecutive odd cycle lengths.
Discret. Math., 2009

A Rainbow k-Matching in the Complete Graph with r Colors.
Electron. J. Comb., 2009

Rainbow Connection in Graphs with Minimum Degree Three.
Proceedings of the Combinatorial Algorithms, 20th International Workshop, 2009

2008
Non-path spectrum sets.
J. Graph Theory, 2008

The independence number in graphs of maximum degree three.
Discret. Math., 2008

Efficiency in exponential time for domination-type problems.
Discret. Appl. Math., 2008

2007
On the complexity of 4-coloring graphs without long induced paths.
Theor. Comput. Sci., 2007

Rainbows in the Hypercube.
Graphs Comb., 2007

New sufficient conditions for hamiltonian and pancyclic graphs.
Discuss. Math. Graph Theory, 2007

A new upper bound for the chromatic number of a graph.
Discuss. Math. Graph Theory, 2007

Chvátal Erdós condition and 2-factors with a specyfied number of components.
Discuss. Math. Graph Theory, 2007

Degree conditions for hamiltonicity: Counting the number of missing edges.
Discret. Math., 2007

Independence number and vertex-disjoint cycles.
Discret. Math., 2007

2006
Extremal Problems for Imbalanced Edges.
Graphs Comb., 2006

Upper bounds for the chromatic number of a graph.
Electron. Notes Discret. Math., 2006

A lower bound on the independence number of a graph in terms of degrees.
Discuss. Math. Graph Theory, 2006

Chvátal-Erdös condition and pancyclism.
Discuss. Math. Graph Theory, 2006

2005
The Cycle-Complete Graph Ramsey Number r<i>(C<sub>5</sub>, K<sub>7</sub>)</i>.
Discuss. Math. Graph Theory, 2005

An Asymptotic Result for the Path Partition Conjecture.
Electron. J. Comb., 2005

Ramsey (K<sub>1,2</sub>,K<sub>3</sub>)-Minimal Graphs.
Electron. J. Comb., 2005

2004
Vertex Colouring and Forbidden Subgraphs - A Survey.
Graphs Comb., 2004

Rainbow numbers for matchings and complete graphs.
Discret. Math., 2004

Cycle lengths and chromatic number of graphs.
Discret. Math., 2004

3-Colorability in P for P<sub>6</sub>-free graphs.
Discret. Appl. Math., 2004

2003
All cycle-complete graph Ramsey numbers <i>r</i>(<i>C<sub>m</sub></i>, <i>K</i><sub>6</sub>).
J. Graph Theory, 2003

Degree conditions for <i>k</i>-ordered hamiltonian graphs.
J. Graph Theory, 2003

Two-factors each component of which contains a specified vertex.
J. Graph Theory, 2003

0-Dual Closures for Several Classes of Graphs.
Graphs Comb., 2003

The Ramsey number r(C<sub>7</sub>, C<sub>7</sub>, C<sub>7</sub>).
Discuss. Math. Graph Theory, 2003

2002
Longest Paths and Longest Cycles in Graphs with Large Degree Sums.
Graphs Comb., 2002

Preface.
Discuss. Math. Graph Theory, 2002

Three-colourability and forbidden subgraphs. II: polynomial algorithms.
Discret. Math., 2002

Forbidden subgraphs implying the MIN-algorithm gives a maximum independent set.
Discret. Math., 2002

Vertex pancyclic graphs.
Discret. Appl. Math., 2002

A note on Brooks' theorem for triangle-free graphs.
Australas. J Comb., 2002

2001
On weights of induced paths and cycles in claw-free and <i>K</i><sub>1</sub><sub><i>, r</i></sub>-free graphs.
J. Graph Theory, 2001

3-Colorability element oF P for p<sub>6</sub>-free Graphs.
Electron. Notes Discret. Math., 2001

On the stability for pancyclicity.
Discuss. Math. Graph Theory, 2001

Colouring Graphs with Prescribed Induced Cycle Lengths.
Discuss. Math. Graph Theory, 2001

On the independence number of a graph in terms of order and size.
Discret. Math., 2001

On a Max-min Problem Concerning Weights of Edges.
Comb., 2001

2000
Closure Concepts: A Survey.
Graphs Comb., 2000

On-line rankings of graphs.
Discret. Math., 2000

1999
3-colored Ramsey Numbers of Odd Cycles.
Electron. Notes Discret. Math., 1999

On quadrilaterals in a graph.
Discret. Math., 1999

Forbidden subgraphs, stability and hamiltonicity.
Discret. Math., 1999

Linear und exponentiell wachsende Kaninchenpopulationen.
Proceedings of the Angewandte Mathematik, 1999

1998
Ramsey numbers r(K<sub>3</sub>, G) for G =~ K<sub>7</sub> - 2P<sub>2</sub> and G =~ K<sub>7</sub> - 3P<sub>2</sub>.
Discret. Math., 1998

2-factors and hamiltonicity.
Discret. Math., 1998

A planarity criterion for cubic bipartite graphs.
Discret. Math., 1998

Approximating Maximum Independent Set in <i>k</i>-Clique-Free Graphs.
Proceedings of the Approximation Algorithms for Combinatorial Optimization, 1998

1997
On the computational complexity of (O, P)-partition problems.
Discuss. Math. Graph Theory, 1997

Dirac's minimum degree condition restricted to claws.
Discret. Math., 1997

Small Cycles in Hamiltonian Graphs.
Discret. Appl. Math., 1997

Ramsey Numbers r(K<sub>3</sub>, G) for Connected Graphs G of Order Seven.
Discret. Appl. Math., 1997

Local connectivity and cycle xtension in claw-free graphs.
Ars Comb., 1997

1996
Toughness and hamiltonicity in almost claw-free graphs.
J. Graph Theory, 1996

1995
Insertible vertices, neighborhood intersections, and hamiltonicity.
J. Graph Theory, 1995

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

The flower conjecture in special classes of graphs.
Discuss. Math. Graph Theory, 1995

On the independence number in K<sub>1, r+1</sub>-free graphs.
Discret. Math., 1995

An Approximation Algorithm for 3-Colourability.
Proceedings of the Graph-Theoretic Concepts in Computer Science, 1995

1994
On Path-Tough Graphs.
SIAM J. Discret. Math., 1994

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

A closure concept based on neighborhood unions of independent triples.
Discret. Math., 1994

Subgraphs, Closures and Hamiltonicity.
Discret. Appl. Math., 1994

Reverse-Fit: A 2-Optimal Algorithm for Packing Rectangles.
Proceedings of the Algorithms, 1994

1993
Computation of the 0-dual closure for hamiltonian graphs.
Discret. Math., 1993

Deciding 3-Colourability in Less Than O(1.415^n) Steps.
Proceedings of the Graph-Theoretic Concepts in Computer Science, 1993

1992
Solving 3-Satisfiability in Less Then 1, 579<sup>n</sup> Steps.
Proceedings of the Computer Science Logic, 6th Workshop, 1992

1989
A Fast Sequential and Parallel Algorithm for the Computation of the k-Closure of a Graph.
Proceedings of the Graph-Theoretic Concepts in Computer Science, 1989

1988
Algorithmen zum Auffinden längster Kreise in Graphen.
PhD thesis, 1988


  Loading...