Ingo Schiermeyer

According to our database1, Ingo Schiermeyer authored at least 138 papers between 1988 and 2019.

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

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

Homepages:

On csauthors.net:

Bibliography

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

On forbidden induced subgraphs for K1, 3-free perfect graphs.
Discrete Mathematics, 2019

On the chromatic number of 2K2-free graphs.
Discrete Applied Mathematics, 2019

2018
Graphs with Conflict-Free Connection Number Two.
Graphs and Combinatorics, 2018

Odd connection and odd vertex-connection of graphs.
Discrete Mathematics, 2018

On upper bounds for the independent transversal domination number.
Discrete Applied Mathematics, 2018

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

On sequential heurestic methods for the maximum independent set problem.
Discussiones Mathematicae Graph Theory, 2017

Local connectivity, local degree conditions, some forbidden induced subgraphs, and cycle extendability.
Discrete Mathematics, 2017

Proper connection and size of graphs.
Discrete Mathematics, 2017

2016
On Star-Wheel Ramsey Numbers.
Graphs and Combinatorics, 2016

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

On the chromatic number of (P5, K2, t)-free graphs.
Electronic Notes in Discrete Mathematics, 2016

On the minimum degree and the proper connection number of graphs.
Electronic Notes in Discrete Mathematics, 2016

Proper connection number 2, connectivity, and forbidden subgraphs.
Electronic Notes in Discrete Mathematics, 2016

Dense arbitrarily partitionable graphs.
Discussiones Mathematicae Graph Theory, 2016

Chromatic number of P5-free graphs: Reed's conjecture.
Discrete Mathematics, 2016

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

Characterizing forbidden pairs for rainbow connection in graphs with minimum degree 2.
Discrete Mathematics, 2016

Kernelization of the 3-path vertex cover problem.
Discrete Mathematics, 2016

Sufficient conditions for 2-rainbow connected graphs.
Discrete Applied Mathematics, 2016

A lower bound on the independence number of a graph in terms of degrees and local clique sizes.
Discrete Applied Mathematics, 2016

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

Rainbow Numbers for Graphs Containing Small Cycles.
Graphs and Combinatorics, 2015

Hypohamiltonian Oriented Graphs of All Possible Orders.
Graphs and Combinatorics, 2015

The Maximum Independent Set Problem in Subclasses of Si, j, k-Free Graphs.
Electronic Notes in Discrete Mathematics, 2015

4-colorability of P6-free graphs.
Electronic Notes in Discrete Mathematics, 2015

Graphs with 4-rainbow index 3 and n-1.
Discussiones Mathematicae Graph Theory, 2015

Graphs with 3-rainbow index n-1 and n-2.
Discussiones Mathematicae Graph Theory, 2015

Extending the Max Algorithm for maximum independent set.
Discussiones Mathematicae Graph Theory, 2015

New sufficient conditions for α-redundant vertices.
Discrete Mathematics, 2015

Rainbow connection and forbidden subgraphs.
Discrete Mathematics, 2015

On forbidden subgraphs and rainbow connection in graphs with minimum degree 2.
Discrete Mathematics, 2015

The Maximum Independent Set Problem in Subclasses of Subcubic Graphs.
Discrete Mathematics, 2015

2014
Rainbow numbers for matchings in plane triangulations.
Discrete Mathematics, 2014

Rainbow connection in oriented graphs.
Discrete Applied Mathematics, 2014

2013
Rainbow connection number of dense graphs.
Discussiones Mathematicae Graph Theory, 2013

Rainbow connection in sparse graphs.
Discussiones Mathematicae Graph Theory, 2013

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

The rainbow connection number of 2-connected graphs.
Discrete Mathematics, 2013

Rainbow connection and minimum degree.
Discrete Applied Mathematics, 2013

On minimally rainbow k-connected graphs.
Discrete Applied Mathematics, 2013

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

2012
Closures, cycles, and paths.
Journal of Graph Theory, 2012

Dense Arbitrarily Vertex Decomposable Graphs.
Graphs and Combinatorics, 2012

Improved degree conditions for Hamiltonian properties.
Discrete Mathematics, 2012

A Dirac theorem for trestles.
Discrete Mathematics, 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.
Electronic Notes in Discrete Mathematics, 2011

Bounds for the rainbow connection number of graphs.
Discussiones Mathematicae Graph Theory, 2011

Graphs with rainbow connection number two.
Discussiones Mathematicae Graph Theory, 2011

Closure for spanning trees and distant area.
Discussiones Mathematicae Graph Theory, 2011

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

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

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

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

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

Packing disjoint cycles over vertex cuts.
Discrete Mathematics, 2010

Approximation algorithms for the minimum rainbow subgraph problem.
Discrete Mathematics, 2010

On maximum independent sets in P5-free graphs.
Discrete Applied Mathematics, 2010

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

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

2009
On F-independence in graphs.
Discussiones Mathematicae Graph Theory, 2009

On the circumference of a graph and its complement.
Discrete Mathematics, 2009

Colourings of graphs with two consecutive odd cycle lengths.
Discrete Mathematics, 2009

A Rainbow k-Matching in the Complete Graph with r Colors.
Electr. 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.
Journal of Graph Theory, 2008

The independence number in graphs of maximum degree three.
Discrete Mathematics, 2008

Efficiency in exponential time for domination-type problems.
Discrete Applied Mathematics, 2008

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

Rainbows in the Hypercube.
Graphs and Combinatorics, 2007

New sufficient conditions for hamiltonian and pancyclic graphs.
Discussiones Mathematicae Graph Theory, 2007

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

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

Degree conditions for hamiltonicity: Counting the number of missing edges.
Discrete Mathematics, 2007

Independence number and vertex-disjoint cycles.
Discrete Mathematics, 2007

2006
Extremal Problems for Imbalanced Edges.
Graphs and Combinatorics, 2006

Upper bounds for the chromatic number of a graph.
Electronic Notes in Discrete Mathematics, 2006

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

Chvátal-Erdös condition and pancyclism.
Discussiones Mathematicae Graph Theory, 2006

2005
The Cycle-Complete Graph Ramsey Number r(C5, K7).
Discussiones Mathematicae Graph Theory, 2005

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

Ramsey (K1,2,K3)-Minimal Graphs.
Electr. J. Comb., 2005

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

Rainbow numbers for matchings and complete graphs.
Discrete Mathematics, 2004

Cycle lengths and chromatic number of graphs.
Discrete Mathematics, 2004

3-Colorability in P for P6-free graphs.
Discrete Applied Mathematics, 2004

2003
All cycle-complete graph Ramsey numbers r(Cm, K6).
Journal of Graph Theory, 2003

Degree conditions for k-ordered hamiltonian graphs.
Journal of Graph Theory, 2003

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

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

The Ramsey number r(C7, C7, C7).
Discussiones Mathematicae Graph Theory, 2003

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

Preface.
Discussiones Mathematicae Graph Theory, 2002

Three-colourability and forbidden subgraphs. II: polynomial algorithms.
Discrete Mathematics, 2002

Forbidden subgraphs implying the MIN-algorithm gives a maximum independent set.
Discrete Mathematics, 2002

Vertex pancyclic graphs.
Discrete Applied Mathematics, 2002

A note on Brooks' theorem for triangle-free graphs.
Australasian J. Combinatorics, 2002

2001
On weights of induced paths and cycles in claw-free and K1, r-free graphs.
Journal of Graph Theory, 2001

3-Colorability element oF P for p6-free Graphs.
Electronic Notes in Discrete Mathematics, 2001

On the stability for pancyclicity.
Discussiones Mathematicae Graph Theory, 2001

Colouring Graphs with Prescribed Induced Cycle Lengths.
Discussiones Mathematicae Graph Theory, 2001

On the independence number of a graph in terms of order and size.
Discrete Mathematics, 2001

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

2000
Closure Concepts: A Survey.
Graphs and Combinatorics, 2000

On-line rankings of graphs.
Discrete Mathematics, 2000

1999
3-colored Ramsey Numbers of Odd Cycles.
Electronic Notes in Discrete Mathematics, 1999

Vertex Pancyclic Graphs.
Electronic Notes in Discrete Mathematics, 1999

On quadrilaterals in a graph.
Discrete Mathematics, 1999

Forbidden subgraphs, stability and hamiltonicity.
Discrete Mathematics, 1999

Colouring Graphs with Prescribed Induced Cycle Lengths.
Proceedings of the Tenth Annual ACM-SIAM Symposium on Discrete Algorithms, 1999

1998
Ramsey numbers r(K3, G) for G =~ K7 - 2P2 and G =~ K7 - 3P2.
Discrete Mathematics, 1998

2-factors and hamiltonicity.
Discrete Mathematics, 1998

A planarity criterion for cubic bipartite graphs.
Discrete Mathematics, 1998

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

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

Dirac's minimum degree condition restricted to claws.
Discrete Mathematics, 1997

Small Cycles in Hamiltonian Graphs.
Discrete Applied Mathematics, 1997

Ramsey Numbers r(K3, G) for Connected Graphs G of Order Seven.
Discrete Applied Mathematics, 1997

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

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

1995
Insertible vertices, neighborhood intersections, and hamiltonicity.
Journal of Graph Theory, 1995

Problems remaining NP-complette for sparse or dense graphs.
Discussiones Mathematicae Graph Theory, 1995

The flower conjecture in special classes of graphs.
Discussiones Mathematicae Graph Theory, 1995

On the independence number in K1, r+1-free graphs.
Discrete Mathematics, 1995

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

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

The k-Satisfiability problem remains NP-complete for dense families.
Discrete Mathematics, 1994

A closure concept based on neighborhood unions of independent triples.
Discrete Mathematics, 1994

Subgraphs, Closures and Hamiltonicity.
Discrete Applied Mathematics, 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.
Discrete Mathematics, 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, 579n 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...