Ingo Schiermeyer

Discuss. Math. Graph Theory, 2026

On k-colorability of (bull,H)-free graphs.

[BibT_eX]

[DOI]

Discret. Math., 2026

2024

Gallai-Ramsey Numbers for Paths.

[BibT_eX]

[DOI]

Graphs Comb., December, 2024

Compatible Spanning Circuits and Forbidden Induced Subgraphs.

[BibT_eX]

[DOI]

Graphs Comb., February, 2024

Complete bipartite graphs without small rainbow subgraphs.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2024

The proper 2-connection number of several graph classes.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2024

Graphs with large (1,2)-rainbow connection numbers.

[BibT_eX]

[DOI]

Thi Thanh Chau Do

Appl. Math. Comput., 2024

The conflict-free connection number and the minimum degree-sum of graphs.

[BibT_eX]

[DOI]

Appl. Math. Comput., 2024

2023

Loose Edge-Connection of Graphs.

[BibT_eX]

[DOI]

Graphs Comb., August, 2023

Gallai-Ramsey numbers for fans.

[BibT_eX]

[DOI]

Discret. Math., May, 2023

2022

Gallai-Ramsey number for K 5 ${K}_{5}$.

[BibT_eX]

[DOI]

Colton Magnant

J. Graph Theory, 2022

Ramsey and Gallai-Ramsey Number for Wheels.

[BibT_eX]

[DOI]

Graphs Comb., 2022

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

[BibT_eX]

[DOI]

Pham Hoang Ha

Graphs Comb., 2022

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

[BibT_eX]

[DOI]

Discret. Math., 2022

The proper 2-connection number and size of graphs.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2022

Homogeneous sets, clique-separators, critical graphs, and optimal χ-binding functions.

[BibT_eX]

[DOI]

Maximilian Geißer

Discret. Appl. Math., 2022

2021

Conflict-Free Connection Number and Size of Graphs.

[BibT_eX]

[DOI]

Graphs Comb., 2021

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

[BibT_eX]

[DOI]

Graphs Comb., 2021

Proper rainbow connection number of graphs.

[BibT_eX]

[DOI]

Discuss. Math. Graph Theory, 2021

Conflict-free vertex connection number at most 3 and size of graphs.

[BibT_eX]

[DOI]

Discuss. Math. Graph Theory, 2021

2020

Gallai-Ramsey number for K 4.

[BibT_eX]

[DOI]

J. Graph Theory, 2020

Ramsey and Gallai-Ramsey numbers for stars with extra independent edges.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2020

2019

Polynomial χ -Binding Functions and Forbidden Induced Subgraphs: A Survey.

[BibT_eX]

[DOI]

Graphs Comb., 2019

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

[BibT_eX]

[DOI]

Discret. Math., 2019

Maximum independent sets near the upper bound.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2019

On the chromatic number of 2K2-free graphs.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2019

2018

Graphs with Conflict-Free Connection Number Two.

[BibT_eX]

[DOI]

Graphs Comb., 2018

Odd connection and odd vertex-connection of graphs.

[BibT_eX]

[DOI]

Discret. Math., 2018

On upper bounds for the independent transversal domination number.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2018

2017

Minimum Degree Conditions for the Proper Connection Number of Graphs.

[BibT_eX]

[DOI]

Graphs Comb., 2017

On sequential heurestic methods for the maximum independent set problem.

[BibT_eX]

[DOI]

Discuss. Math. Graph Theory, 2017

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

[BibT_eX]

[DOI]

Dieter Rautenbach

Discret. Math., 2017

Proper connection and size of graphs.

[BibT_eX]

[DOI]

Discret. Math., 2017

2016

On Star-Wheel Ramsey Numbers.

[BibT_eX]

[DOI]

Binlong Li

Graphs Comb., 2016

On the Maximum Weight of a Sparse Connected Graph of Given Order and Size.

[BibT_eX]

[DOI]

Mirko Hornák

Graphs Comb., 2016

On the chromatic number of (P5, K2, t)-free graphs.

[BibT_eX]

[DOI]

Electron. Notes Discret. Math., 2016

On the minimum degree and the proper connection number of graphs.

[BibT_eX]

[DOI]

Electron. Notes Discret. Math., 2016

Proper connection number 2, connectivity, and forbidden subgraphs.

[BibT_eX]

[DOI]

Electron. Notes Discret. Math., 2016

Dense arbitrarily partitionable graphs.

[BibT_eX]

[DOI]

Discuss. Math. Graph Theory, 2016

Chromatic number of P5-free graphs: Reed's conjecture.

[BibT_eX]

[DOI]

Discret. Math., 2016

On the maximum weight of a dense connected graph of given order and size.

[BibT_eX]

[DOI]

Mirko Hornák

Discret. Math., 2016

Characterizing forbidden pairs for rainbow connection in graphs with minimum degree 2.

[BibT_eX]

[DOI]

Discret. Math., 2016

Kernelization of the 3-path vertex cover problem.

[BibT_eX]

[DOI]

Discret. Math., 2016

Sufficient conditions for 2-rainbow connected graphs.

[BibT_eX]

[DOI]

Arnfried Kemnitz

Discret. Appl. Math., 2016

A lower bound on the independence number of a graph in terms of degrees and local clique sizes.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2016

2015

Rainbow Numbers for Cycles in Plane Triangulations.

[BibT_eX]

[DOI]

J. Graph Theory, 2015

Rainbow Numbers for Graphs Containing Small Cycles.

[BibT_eX]

[DOI]

Roman Soták

Graphs Comb., 2015

Hypohamiltonian Oriented Graphs of All Possible Orders.

[BibT_eX]

[DOI]

Graphs Comb., 2015

The Maximum Independent Set Problem in Subclasses of Si, j, k-Free Graphs.

[BibT_eX]

[DOI]

Electron. Notes Discret. Math., 2015

4-colorability of P6-free graphs.

[BibT_eX]

[DOI]

Rastislav Krivos-Bellus

Electron. Notes Discret. Math., 2015

Graphs with 4-rainbow index 3 and n-1.

[BibT_eX]

[DOI]

Discuss. Math. Graph Theory, 2015

Graphs with 3-rainbow index n-1 and n-2.

[BibT_eX]

[DOI]

Discuss. Math. Graph Theory, 2015

Extending the Max Algorithm for maximum independent set.

[BibT_eX]

[DOI]

Discuss. Math. Graph Theory, 2015

New sufficient conditions for α-redundant vertices.

[BibT_eX]

[DOI]

Discret. Math., 2015

Rainbow connection and forbidden subgraphs.

[BibT_eX]

[DOI]

Discret. Math., 2015

On forbidden subgraphs and rainbow connection in graphs with minimum degree 2.

[BibT_eX]

[DOI]

Premysl Holub

Discret. Math., 2015

The Maximum Independent Set Problem in Subclasses of Subcubic Graphs.

[BibT_eX]

[DOI]

Discret. Math., 2015

2014

Rainbow numbers for matchings in plane triangulations.

[BibT_eX]

[DOI]

Jianhua Tu

Discret. Math., 2014

Rainbow connection in oriented graphs.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2014

2013

Rainbow connection number of dense graphs.

[BibT_eX]

[DOI]

Xueliang Li

Mengmeng Liu

Discuss. Math. Graph Theory, 2013

Rainbow connection in sparse graphs.

[BibT_eX]

[DOI]

Discuss. Math. Graph Theory, 2013

On maximum weight of a bipartite graph of given order and size.

[BibT_eX]

[DOI]

Mirko Hornák

Discuss. Math. Graph Theory, 2013

The rainbow connection number of 2-connected graphs.

[BibT_eX]

[DOI]

Discret. Math., 2013

Rainbow connection and minimum degree.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2013

On minimally rainbow k-connected graphs.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2013

On the minimum rainbow subgraph number of a graph.

[BibT_eX]

[DOI]

Ars Math. Contemp., 2013

2012

Closures, cycles, and paths.

[BibT_eX]

[DOI]

J. Graph Theory, 2012

Dense Arbitrarily Vertex Decomposable Graphs.

[BibT_eX]

[DOI]

Graphs Comb., 2012

Improved degree conditions for Hamiltonian properties.

[BibT_eX]

[DOI]

Arnfried Kemnitz

Discret. Math., 2012

A Dirac theorem for trestles.

[BibT_eX]

[DOI]

Discret. Math., 2012

2011

On computing the minimum 3-path vertex cover and dissociation number of graphs.

[BibT_eX]

[DOI]

Frantisek Kardos

Ján Katrenic

Theor. Comput. Sci., 2011

Improved approximation bounds for the minimum rainbow subgraph problem.

[BibT_eX]

[DOI]

Ján Katrenic

Inf. Process. Lett., 2011

Algorithmic approaches for the minimum rainbow subgraph problem.

[BibT_eX]

[DOI]

Maria Koch

Electron. Notes Discret. Math., 2011

Bounds for the rainbow connection number of graphs.

[BibT_eX]

[DOI]

Discuss. Math. Graph Theory, 2011

Graphs with rainbow connection number two.

[BibT_eX]

[DOI]

Arnfried Kemnitz

Discuss. Math. Graph Theory, 2011

Closure for spanning trees and distant area.

[BibT_eX]

[DOI]

Jun Fujisawa

Akira Saito

Discuss. Math. Graph Theory, 2011

A New Bound on the Domination Number of Graphs with Minimum Degree Two.

[BibT_eX]

[DOI]

Michael A. Henning

Anders Yeo

Electron. J. Comb., 2011

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

[BibT_eX]

[DOI]

Comb., 2011

2010

Cycle length parities and the chromatic number.

[BibT_eX]

[DOI]

Christian Löwenstein

Dieter Rautenbach

J. Graph Theory, 2010

Structural Properties and Hamiltonicity of Neighborhood Graphs.

[BibT_eX]

[DOI]

Martin Sonntag

Hanns-Martin Teichert

Graphs Comb., 2010

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

[BibT_eX]

[DOI]

Anja Kohl

Discret. Math., 2010

Packing disjoint cycles over vertex cuts.

[BibT_eX]

[DOI]

Discret. Math., 2010

Approximation algorithms for the minimum rainbow subgraph problem.

[BibT_eX]

[DOI]

Zsolt Tuza

Discret. Math., 2010

On maximum independent sets in P5-free graphs.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2010

Random Procedures for Dominating Sets in Graphs.

[BibT_eX]

[DOI]

Electron. J. Comb., 2010

Progress on Rainbow Connection.

[BibT_eX]

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

2009

On F-independence in graphs.

[BibT_eX]

[DOI]

Discuss. Math. Graph Theory, 2009

On the circumference of a graph and its complement.

[BibT_eX]

[DOI]

Linda M. Lesniak

Discret. Math., 2009

Colourings of graphs with two consecutive odd cycle lengths.

[BibT_eX]

[DOI]

Discret. Math., 2009

A Rainbow k-Matching in the Complete Graph with r Colors.

[BibT_eX]

[DOI]

Electron. J. Comb., 2009

Rainbow Connection in Graphs with Minimum Degree Three.

[BibT_eX]

[DOI]

Proceedings of the Combinatorial Algorithms, 20th International Workshop, 2009

2008

Non-path spectrum sets.

[BibT_eX]

[DOI]

J. Graph Theory, 2008

The independence number in graphs of maximum degree three.

[BibT_eX]

[DOI]

Discret. Math., 2008

Efficiency in exponential time for domination-type problems.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2008

2007

On the complexity of 4-coloring graphs without long induced paths.

[BibT_eX]

[DOI]

Van Bang Le

Theor. Comput. Sci., 2007

Rainbows in the Hypercube.

[BibT_eX]

[DOI]

Graphs Comb., 2007

New sufficient conditions for hamiltonian and pancyclic graphs.

[BibT_eX]

[DOI]

Mariusz Wozniak

Discuss. Math. Graph Theory, 2007

A new upper bound for the chromatic number of a graph.

[BibT_eX]

[DOI]

Discuss. Math. Graph Theory, 2007

Chvátal Erdós condition and 2-factors with a specyfied number of components.

[BibT_eX]

[DOI]

Guantao Chen

Ronald J. Gould

Ken-ichi Kawarabayashi

Katsuhiro Ota

Akira Saito

Discuss. Math. Graph Theory, 2007

Degree conditions for hamiltonicity: Counting the number of missing edges.

[BibT_eX]

[DOI]

Discret. Math., 2007

Independence number and vertex-disjoint cycles.

[BibT_eX]

[DOI]

Discret. Math., 2007

2006

Extremal Problems for Imbalanced Edges.

[BibT_eX]

[DOI]

Dieter Rautenbach

Graphs Comb., 2006

Upper bounds for the chromatic number of a graph.

[BibT_eX]

[DOI]

Electron. Notes Discret. Math., 2006

A lower bound on the independence number of a graph in terms of degrees.

[BibT_eX]

[DOI]

Discuss. Math. Graph Theory, 2006

Chvátal-Erdös condition and pancyclism.

[BibT_eX]

[DOI]

Discuss. Math. Graph Theory, 2006

2005

The Cycle-Complete Graph Ramsey Number r(C5, K7).

[BibT_eX]

[DOI]

Discuss. Math. Graph Theory, 2005

An Asymptotic Result for the Path Partition Conjecture.

[BibT_eX]

[DOI]

Marietjie Frick

Electron. J. Comb., 2005

Ramsey (K1,2,K3)-Minimal Graphs.

[BibT_eX]

[DOI]

Mieczyslaw Borowiecki

Elzbieta Sidorowicz

Electron. J. Comb., 2005

2004

Vertex Colouring and Forbidden Subgraphs - A Survey.

[BibT_eX]

[DOI]

Graphs Comb., 2004

Rainbow numbers for matchings and complete graphs.

[BibT_eX]

[DOI]

Discret. Math., 2004

Cycle lengths and chromatic number of graphs.

[BibT_eX]

[DOI]

Peter Mihók

Discret. Math., 2004

3-Colorability in P for P6-free graphs.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2004

2003

All cycle-complete graph Ramsey numbers r(Cm, K6).

[BibT_eX]

[DOI]

J. Graph Theory, 2003

Degree conditions for k-ordered hamiltonian graphs.

[BibT_eX]

[DOI]

Ronald J. Gould

Alexandr V. Kostochka

Linda M. Lesniak

Akira Saito

J. Graph Theory, 2003

Two-factors each component of which contains a specified vertex.

[BibT_eX]

[DOI]

J. Graph Theory, 2003

0-Dual Closures for Several Classes of Graphs.

[BibT_eX]

[DOI]

Ahmed Ainouche

Graphs Comb., 2003

The Ramsey number r(C7, C7, C7).

[BibT_eX]

[DOI]

Discuss. Math. Graph Theory, 2003

2002

Longest Paths and Longest Cycles in Graphs with Large Degree Sums.

[BibT_eX]

[DOI]

Meike Tewes

Graphs Comb., 2002

Preface.

[BibT_eX]

[DOI]

Margit Voigt

Discuss. Math. Graph Theory, 2002

Three-colourability and forbidden subgraphs. II: polynomial algorithms.

[BibT_eX]

[DOI]

Meike Tewes

Discret. Math., 2002

Forbidden subgraphs implying the MIN-algorithm gives a maximum independent set.

[BibT_eX]

[DOI]

Discret. Math., 2002

A note on Brooks' theorem for triangle-free graphs.

[BibT_eX]

[DOI]

Australas. J Comb., 2002

2001

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

[BibT_eX]

[DOI]

J. Graph Theory, 2001

3-Colorability element oF P for p6-free Graphs.

[BibT_eX]

[DOI]

Electron. Notes Discret. Math., 2001

On the stability for pancyclicity.

[BibT_eX]

[DOI]

Discuss. Math. Graph Theory, 2001

On the independence number of a graph in terms of order and size.

[BibT_eX]

[DOI]

Discret. Math., 2001

On a Max-min Problem Concerning Weights of Edges.

[BibT_eX]

[DOI]

Comb., 2001

2000

Closure Concepts: A Survey.

[BibT_eX]

[DOI]

Hajo Broersma

Graphs Comb., 2000

On-line rankings of graphs.

[BibT_eX]

[DOI]

Zsolt Tuza

Margit Voigt

Discret. Math., 2000

1999

3-colored Ramsey Numbers of Odd Cycles.

[BibT_eX]

[DOI]

Electron. Notes Discret. Math., 1999

Vertex Pancyclic Graphs.

[BibT_eX]

[DOI]

Electron. Notes Discret. Math., 1999

On quadrilaterals in a graph.

[BibT_eX]

[DOI]

Hong Wang

Discret. Math., 1999

Forbidden subgraphs, stability and hamiltonicity.

[BibT_eX]

[DOI]

Jan Brousek

Discret. Math., 1999

Colouring Graphs with Prescribed Induced Cycle Lengths.

[BibT_eX]

[DOI]

Proceedings of the Tenth Annual ACM-SIAM Symposium on Discrete Algorithms, 1999

Linear und exponentiell wachsende Kaninchenpopulationen.

[BibT_eX]

[DOI]

Proceedings of the Angewandte Mathematik, 1999

1998

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

[BibT_eX]

[DOI]

Discret. Math., 1998

2-factors and hamiltonicity.

[BibT_eX]

[DOI]

Discret. Math., 1998

A planarity criterion for cubic bipartite graphs.

[BibT_eX]

[DOI]

Discret. Math., 1998

Approximating Maximum Independent Set in k-Clique-Free Graphs.

[BibT_eX]

[DOI]

Proceedings of the Approximation Algorithms for Combinatorial Optimization, 1998

1997

On the computational complexity of (O, P)-partition problems.

[BibT_eX]

[DOI]

Jan Kratochvíl

Discuss. Math. Graph Theory, 1997

Dirac's minimum degree condition restricted to claws.

[BibT_eX]

[DOI]

Haitze J. Broersma

Discret. Math., 1997

Small Cycles in Hamiltonian Graphs.

[BibT_eX]

[DOI]

Uwe Schelten

Discret. Appl. Math., 1997

Ramsey Numbers r(K3, G) for Connected Graphs G of Order Seven.

[BibT_eX]

[DOI]

Discret. Appl. Math., 1997

Local connectivity and cycle xtension in claw-free graphs.

[BibT_eX]

Ars Comb., 1997

1996

Toughness and hamiltonicity in almost claw-free graphs.

[BibT_eX]

[DOI]

Haitze J. Broersma

J. Graph Theory, 1996

1995

Insertible vertices, neighborhood intersections, and hamiltonicity.

[BibT_eX]

[DOI]

Ahmed Ainouche

J. Graph Theory, 1995

Problems remaining NP-complette for sparse or dense graphs.

[BibT_eX]

[DOI]

Discuss. Math. Graph Theory, 1995

The flower conjecture in special classes of graphs.

[BibT_eX]

[DOI]

Discuss. Math. Graph Theory, 1995

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

[BibT_eX]

[DOI]

Discret. Math., 1995

An Approximation Algorithm for 3-Colourability.

[BibT_eX]

[DOI]

Proceedings of the Graph-Theoretic Concepts in Computer Science, 1995

1994

On Path-Tough Graphs.

[BibT_eX]

[DOI]

Peter Dankelmann

Thomas Niessen

SIAM J. Discret. Math., 1994

The k-Satisfiability problem remains NP-complete for dense families.

[BibT_eX]

[DOI]

Discret. Math., 1994

A closure concept based on neighborhood unions of independent triples.

[BibT_eX]

[DOI]

Haitze J. Broersma

Discret. Math., 1994

Subgraphs, Closures and Hamiltonicity.

[BibT_eX]

[DOI]

Hajo Broersma

Discret. Appl. Math., 1994

Reverse-Fit: A 2-Optimal Algorithm for Packing Rectangles.

[BibT_eX]

[DOI]

Proceedings of the Algorithms, 1994

1993

Computation of the 0-dual closure for hamiltonian graphs.

[BibT_eX]

[DOI]

Discret. Math., 1993

Deciding 3-Colourability in Less Than O(1.415^n) Steps.

[BibT_eX]

[DOI]

Proceedings of the Graph-Theoretic Concepts in Computer Science, 1993

1992

Solving 3-Satisfiability in Less Then 1, 579n Steps.

[BibT_eX]

[DOI]

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.

[BibT_eX]

[DOI]

Proceedings of the Graph-Theoretic Concepts in Computer Science, 1989

1988

Algorithmen zum Auffinden längster Kreise in Graphen.

[BibT_eX]

[DOI]