|
+
|
Gallai–Ramsey Numbers for Paths
|
2024
|
Ping Li
Yaping Mao
Ingo Schiermeyer
Yifan Yao
|
|
+
PDF
Chat
|
On 3-colourability of $(bull, H)$-free graphs
|
2024
|
Nadzieja Hodur
Monika Pilśniak
Magdalena Prorok
Ingo Schiermeyer
|
|
+
PDF
Chat
|
Compatible Spanning Circuits and Forbidden Induced Subgraphs
|
2024
|
Zhiwei Guo
Christoph Brause
Maximilian Geißer
Ingo Schiermeyer
|
|
+
|
Ramsey and Gallai-Ramsey numbers for linear forests and kipas
|
2024
|
Ping Li
Yaping Mao
Ingo Schiermeyer
Yifan Yao
|
|
+
|
Complete bipartite graphs without small rainbow subgraphs
|
2023
|
Zhiqiang Ma
Yaping Mao
Ingo Schiermeyer
Meiqin Wei
|
|
+
PDF
Chat
|
Gallai-Ramsey numbers for fans
|
2023
|
Yaping Mao
Zhao Wang
Colton Magnant
Ingo Schiermeyer
|
|
+
|
The Conflict-Free Vertex-Connection Number and Degree Conditions of Graphs
|
2022
|
Trung Duy Doan
Pham Hoang Ha
Ingo Schiermeyer
|
|
+
PDF
Chat
|
Gallai—Ramsey Number for the Union of Stars
|
2022
|
Yaping Mao
Zhao Wang
Colton Magnant
Ingo Schiermeyer
|
|
+
|
The proper 2-connection number and size of graphs
|
2022
|
Trung Duy Doan
Ingo Schiermeyer
|
|
+
|
Homogeneous sets, clique-separators, critical graphs, and optimal <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="d1e29" altimg="si20.svg"><mml:mi>χ</mml:mi></mml:math>-binding functions
|
2022
|
Christoph Brause
Maximilian Geißer
Ingo Schiermeyer
|
|
+
|
Gallai–Ramsey number for K5 ${K}_{5}$
|
2022
|
Colton Magnant
Ingo Schiermeyer
|
|
+
PDF
Chat
|
Forbidden induced subgraphs for perfectness of claw-free graphs of independence number at least 4
|
2022
|
Christoph Brause
Trung Duy Doan
Přemysl Holub
Adam Kabela
Zdeněk Ryjáček
Ingo Schiermeyer
Petr Vrána
|
|
+
PDF
Chat
|
Ramsey and Gallai-Ramsey Number for Wheels
|
2022
|
Yaping Mao
Zhao Wang
Colton Magnant
Ingo Schiermeyer
|
|
+
|
Loose edge-connection of graphs
|
2022
|
Christoph Brause
Stanislav Jendrol’
Ingo Schiermeyer
|
|
+
|
Conflict-Free Connection Number and Size of Graphs
|
2021
|
Trung Duy Doan
Ingo Schiermeyer
|
|
+
|
From Colourful to Rainbow Paths in Graphs: Colouring the Vertices
|
2021
|
Christoph Brause
Stanislav Jendrol’
Ingo Schiermeyer
|
|
+
|
Forbidden induced subgraphs and perfectness for claw-free graphs of independence at least 4
|
2021
|
Christoph Brause
Trung Duy Doan
Přemysl Holub
Adam Kabela
Zdeněk Ryjáček
Ingo Schiermeyer
Petr Vrána
|
|
+
|
Gallai-Ramsey Number for Complete Graphs
|
2021
|
Colton Magnant
Ingo Schiermeyer
|
|
+
|
On the irredundant and mixed Ramsey numbers
|
2021
|
Meng Ji
Yaping Mao
Ingo Schiermeyer
|
|
+
|
Forbidden induced subgraphs for perfectness of claw-free graphs of independence number at least 4
|
2021
|
Christoph Brause
Trung Duy Doan
Přemysl Holub
Adam Kabela
Zdeněk Ryjáček
Ingo Schiermeyer
Petr Vrána
|
|
+
|
Ramsey and Gallai–Ramsey numbers for stars with extra independent edges
|
2020
|
Yaping Mao
Zhao Wang
Colton Magnant
Ingo Schiermeyer
|
|
+
|
Proper rainbow connection number of graphs
|
2020
|
Trung Duy Doan
Ingo Schiermeyer
|
|
+
|
Homogeneous sets, clique-separators, critical graphs, and optimal $\chi$-binding functions
|
2020
|
Christoph Brause
Maximilan Geißer
Ingo Schiermeyer
|
|
+
|
Homogeneous sets, clique-separators, critical graphs, and optimal $χ$-binding functions
|
2020
|
Christoph Brause
Maximilian Geißer
Ingo Schiermeyer
|
|
+
|
Gallai‐Ramsey number for K4
|
2019
|
Henry Liu
Colton Magnant
Akira Saito
Ingo Schiermeyer
Yongtang Shi
|
|
+
|
Proper rainbow connection number of graphs
|
2019
|
Trung Duy Doan
Ingo Schiermeyer
|
|
+
|
Conflict-free vertex connection number at most 3 and size of graphs
|
2019
|
Trung Duy Doan
Ingo Schiermeyer
|
|
+
|
On forbidden induced subgraphs for K_{1,3}-free perfect graphs
|
2019
|
Christoph Brause
Přemysl Holub
Adam Kabela
Zdeněk Ryjáček
Ingo Schiermeyer
Petr Vrána
|
|
+
|
On forbidden induced subgraphs for <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" overflow="scroll" id="d1e150" altimg="si18.gif"><mml:msub><mml:mrow><mml:mi>K</mml:mi></mml:mrow><mml:mrow><mml:mn>1</mml:mn><mml:mo>,</mml:mo><mml:mn>3</mml:mn></mml:mrow></mml:msub></mml:math>-free perfect graphs
|
2019
|
Christoph Brause
Přemysl Holub
Adam Kabela
Zdeněk Ryjáček
Ingo Schiermeyer
Petr Vrána
|
|
+
|
Gallai-Ramsey number for $K_{5}$
|
2019
|
Colton Magnant
Ingo Schiermeyer
|
|
+
|
Polynomial $$\chi $$ χ -Binding Functions and Forbidden Induced Subgraphs: A Survey
|
2019
|
Ingo Schiermeyer
Bert Randerath
|
|
+
|
Gallai-Ramsey numbers for fans
|
2019
|
Yaping Mao
Zhao Wang
Colton Magnant
Ingo Schiermeyer
|
|
+
|
Ramsey and Gallai-Ramsey number for wheels
|
2019
|
Yaping Mao
Zhao Wang
Colton Magnant
Ingo Schiermeyer
|
|
+
|
Ramsey and Gallai-Ramsey numbers for stars with extra independent edges
|
2019
|
Yaping Mao
Zhao Wang
Colton Magnant
Ingo Schiermeyer
|
|
+
|
Proper rainbow connection number of graphs
|
2019
|
Trung Duy Doan
Ingo Schiermeyer
|
|
+
|
On forbidden induced subgraphs for K_{1,3}-free perfect graphs
|
2019
|
Christoph Brause
Přemysl Holub
Adam Kabela
Zdeněk Ryjáček
Ingo Schiermeyer
Petr Vrána
|
|
+
|
Gallai-Ramsey number for $K_{5}$
|
2019
|
Colton Magnant
Ingo Schiermeyer
|
|
+
|
On the chromatic number of <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" overflow="scroll" id="d1e28" altimg="si11.gif"><mml:mn>2</mml:mn><mml:msub><mml:mrow><mml:mi>K</mml:mi></mml:mrow><mml:mrow><mml:mn>2</mml:mn></mml:mrow></mml:msub></mml:math>-free graphs
|
2018
|
Christoph Brause
Bert Randerath
Ingo Schiermeyer
Elkin Vumar
|
|
+
PDF
Chat
|
Graphs with Conflict-Free Connection Number Two
|
2018
|
Hong Chang
Trung Duy Doan
Zhong Huang
Stanislav Jendrol’
Xueliang Li
Ingo Schiermeyer
|
|
+
|
Odd connection and odd vertex-connection of graphs
|
2018
|
Christoph Brause
Stanislav Jendrol’
Ingo Schiermeyer
|
|
+
|
Maximum independent sets near the upper bound
|
2018
|
Ingo Schiermeyer
|
|
+
PDF
Chat
|
On upper bounds for the independent transversal domination number
|
2017
|
Christoph Brause
Michael A. Henning
Kenta Ozeki
Ingo Schiermeyer
Elkin Vumar
|
|
+
|
Maximum independent sets near the upper bound
|
2017
|
Ingo Schiermeyer
|
|
+
|
Local connectivity, local degree conditions, some forbidden induced subgraphs, and cycle extendability
|
2017
|
Christoph Brause
Dieter Rautenbach
Ingo Schiermeyer
|
|
+
|
On sequential heurestic methods for the maximum independent set problem
|
2017
|
Christoph Brause
Ngoc C. Lê
Ingo Schiermeyer
|
|
+
|
On the chromatic number of (P_{5},windmill)-free graphs
|
2017
|
Ingo Schiermeyer
|
|
+
|
Graphs with conflict-free connection number two
|
2017
|
Hong Chang
Trung Duy Doan
Zhong Huang
Xueliang Li
Ingo Schiermeyer
|
|
+
|
Maximum independent sets near the upper bound
|
2017
|
Ingo Schiermeyer
|
|
+
|
Proper connection and size of graphs
|
2016
|
Susan A. van Aardt
Christoph Brause
Alewyn P. Burger
Marietjie Frick
Arnfried Kemnitz
Ingo Schiermeyer
|
|
+
|
On the chromatic number of (P5, K2,)-free graphs
|
2016
|
Christoph Brause
Trung Duy Doan
Ingo Schiermeyer
|
|
+
|
Proper connection number 2, connectivity, and forbidden subgraphs
|
2016
|
Christoph Brause
Trung Duy Doan
Ingo Schiermeyer
|
|
+
|
Chromatic number of <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" altimg="si11.gif" display="inline" overflow="scroll"><mml:msub><mml:mrow><mml:mi>P</mml:mi></mml:mrow><mml:mrow><mml:mn>5</mml:mn></mml:mrow></mml:msub></mml:math>-free graphs: Reed’s conjecture
|
2015
|
Ingo Schiermeyer
|
|
+
|
Characterizing forbidden pairs for rainbow connection in graphs with minimum degree 2
|
2015
|
Přemysl Holub
Zdeněk Ryjáček
Ingo Schiermeyer
Petr Vrána
|
|
+
|
Sufficient conditions for 2-rainbow connected graphs
|
2015
|
Arnfried Kemnitz
Ingo Schiermeyer
|
|
+
|
4-colorability of P 6 -free graphs
|
2015
|
Christoph Brause
Ingo Schiermeyer
Přemysl Holub
Zdeněk Ryjáček
Petr Vrána
Rastislav Krivoš-Belluš
|
|
+
|
On the Maximum Weight of a Sparse Connected Graph of Given Order and Size
|
2015
|
Mirko Horňák
Stanislav Jendrol’
Ingo Schiermeyer
|
|
+
|
Dense arbitrarily partitionable graphs
|
2015
|
Rafał Kalinowski
Monika Pilśniak
Ingo Schiermeyer
Mariusz Woźniak
|
|
+
|
Local Connectivity, Local Degree Conditions, some Forbidden Induced Subgraphs, and Cycle Extendability
|
2015
|
Christoph Brause
Dieter Rautenbach
Ingo Schiermeyer
|
|
+
PDF
Chat
|
On Star–Wheel Ramsey Numbers
|
2015
|
Binlong Li
Ingo Schiermeyer
|
|
+
|
On the maximum weight of a dense connected graph of given order and size
|
2015
|
Mirko Horňák
Stanislav Jendrol’
Ingo Schiermeyer
|
|
+
|
Rainbow Numbers for Graphs Containing Small Cycles
|
2015
|
Ingo Schiermeyer
Roman Soták
|
|
+
|
Graphs with 4-rainbow index 3 and n-1
|
2015
|
Xue Liang Li
Ingo Schiermeyer
Kang Yang
Yan Zhao
|
|
+
|
On star-wheel Ramsey numbers
|
2015
|
Binlong Li
Ingo Schiermeyer
|
|
+
|
Local Connectivity, Local Degree Conditions, some Forbidden Induced Subgraphs, and Cycle Extendability
|
2015
|
Christoph Brause
Dieter Rautenbach
Ingo Schiermeyer
|
|
+
|
Graphs with 3-rainbow index n-1 and n-2
|
2014
|
Xue Liang Li
Ingo Schiermeyer
Kang Yang
Yan Zhao
|
|
+
|
On forbidden subgraphs and rainbow connection in graphs with minimum degree 2
|
2014
|
Přemysl Holub
Zdeněk Ryjáček
Ingo Schiermeyer
|
|
+
|
Rainbow connection and forbidden subgraphs
|
2014
|
Přemysl Holub
Zdeněk Ryjáček
Ingo Schiermeyer
Petr Vrána
|
|
+
|
Rainbow numbers for matchings in plane triangulations
|
2014
|
Stanislav Jendrol’
Ingo Schiermeyer
Jianhua Tu
|
|
+
|
Rainbow Numbers for Cycles in Plane Triangulations
|
2014
|
Mirko Horňák
Stanislav Jendrol’
Ingo Schiermeyer
Roman Soták
|
|
+
|
Graphs with $4$-rainbow index $n-1$
|
2013
|
Xueliang Li
Ingo Schiermeyer
Kang Yang
Yan Zhao
|
|
+
PDF
Chat
|
Rainbow connection number of dense graphs
|
2013
|
Xue Liang Li
Mengmeng Liu
Ingo Schiermeyer
|
|
+
PDF
Chat
|
On maximum weight of a bipartite graph of given order and size
|
2013
|
Mirko Horňák
Stanislav Jendrol’
Ingo Schiermeyer
|
|
+
|
Graphs with $4$-rainbow index $3$ and $n-1$
|
2013
|
Xueliang Li
Ingo Schiermeyer
Kang Yang
Yan Zhao
|
|
+
PDF
Chat
|
Rainbow connection in sparse graphs
|
2012
|
Arnfried Kemnitz
Jakub Przybyło
Ingo Schiermeyer
Mariusz Woźniak
|
|
+
PDF
Chat
|
On the minimum rainbow subgraph number of a graph
|
2012
|
Ingo Schiermeyer
|
|
+
|
The rainbow connection number of 2-connected graphs
|
2012
|
Jan Ekstein
Přemysl Holub
Tomáš Kaiser
Maria Koch
Stephan Matos Camacho
Zdeněk Ryjáček
Ingo Schiermeyer
|
|
+
|
A Dirac theorem for trestles
|
2012
|
Stanislav Jendrol’
Tomáš Kaiser
Zdeněk Ryjáček
Ingo Schiermeyer
|
|
+
|
Rainbow numbers for graphs with cyclomatic number at most two
|
2012
|
Ingo Schiermeyer
Roman Soták
|
|
+
|
Rainbow connection and minimum degree
|
2011
|
Ingo Schiermeyer
|
|
+
|
The rainbow connection number of 2-connected graphs
|
2011
|
Jan Ekstein
Přemysl Holub
Tomáš Kaiser
Maria Koch
Stephan Matos Camacho
Zdeněk Ryjáček
Ingo Schiermeyer
|
|
+
PDF
Chat
|
Dense Arbitrarily Vertex Decomposable Graphs
|
2011
|
Mirko Horňák
Antoni Marczyk
Ingo Schiermeyer
Mariusz Woźniak
|
|
+
|
Improved degree conditions for Hamiltonian properties
|
2011
|
Arnfried Kemnitz
Ingo Schiermeyer
|
|
+
|
On minimally rainbow<mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" altimg="si1.gif" display="inline" overflow="scroll"><mml:mi>k</mml:mi></mml:math>-connected graphs
|
2011
|
Ingo Schiermeyer
|
|
+
|
Closures, cycles, and paths
|
2011
|
Jochen Harant
Arnfried Kemnitz
Akira Saito
Ingo Schiermeyer
|
|
+
PDF
Chat
|
A New Bound on the Domination Number of Graphs with Minimum Degree Two
|
2011
|
Michael A. Henning
Ingo Schiermeyer
Anders Yeo
|
|
+
PDF
Chat
|
Closure for spanning trees and distant area
|
2011
|
Jun Fujisawa
Akira Saito
Ingo Schiermeyer
|
|
+
PDF
Chat
|
Bounds for the rainbow connection number of graphs
|
2011
|
Ingo Schiermeyer
|
|
+
|
Rainbow connection number of dense graphs
|
2011
|
Xueliang Li
Mengmeng Liu
Ingo Schiermeyer
|
|
+
|
The rainbow connection number of 2-connected graphs
|
2011
|
Jan Ekstein
Přemysl Holub
Tomáš Kaiser
Maria Koch
Stephan Matos Camacho
Zdeněk Ryjáček
Ingo Schiermeyer
|
|
+
PDF
Chat
|
Random Procedures for Dominating Sets in Graphs
|
2010
|
Sarah Artmann
Frank Göring
Jochen Harant
Dieter Rautenbach
Ingo Schiermeyer
|
|
+
|
Packing disjoint cycles over vertex cuts
|
2010
|
Jochen Harant
Dieter Rautenbach
Peter Recht
Ingo Schiermeyer
Eva-Maria Sprengel
|
|
+
|
Structural Properties and Hamiltonicity of Neighborhood Graphs
|
2010
|
Ingo Schiermeyer
Martin Sonntag
Hanns‐Martin Teichert
|
|
+
|
On maximum independent sets in <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" altimg="si1.gif" display="inline" overflow="scroll"><mml:msub><mml:mrow><mml:mi>P</mml:mi></mml:mrow><mml:mrow><mml:mn>5</mml:mn></mml:mrow></mml:msub></mml:math>-free graphs
|
2010
|
Bert Randerath
Ingo Schiermeyer
|
|
+
|
Progress on rainbow connection
|
2010
|
Ingo Schiermeyer
|
|
+
PDF
Chat
|
Cycle length parities and the chromatic number
|
2009
|
Christian Löwenstein
Dieter Rautenbach
Ingo Schiermeyer
|
|
+
|
Some results on Reed’s Conjecture about <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" altimg="si2.gif" display="inline" overflow="scroll"><mml:mi>ω</mml:mi><mml:mo>,</mml:mo><mml:mi>Δ</mml:mi></mml:math>, and <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" altimg="si3.gif" display="inline" overflow="scroll"><mml:mi>χ</mml:mi></mml:math> with respect to <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" altimg="si4.gif" display="inline" overflow="scroll"><mml:mi>α</mml:…
|
2009
|
Anja Köhl
Ingo Schiermeyer
|
|
+
PDF
Chat
|
A Rainbow $k$-Matching in the Complete Graph with $r$ Colors
|
2009
|
Shinya Fujita
Atsushi Kaneko
Ingo Schiermeyer
Kazuhiro Suzuki
|
|
+
PDF
Chat
|
On F-independence in graphs
|
2009
|
Frank Göring
Jochen Harant
Dieter Rautenbach
Ingo Schiermeyer
|
|
+
|
Rainbow Connection in Graphs with Minimum Degree Three
|
2009
|
Ingo Schiermeyer
|
|
+
|
ON RAINBOW INDEPENDENT SETS
|
2009
|
Christoph Brause
Ingo Schiermeyer
Gabriel Semani
|
|
+
|
Locally Dense Independent Sets in Regular Graphs of Large Girth—An Example of a New Approach
|
2008
|
Frank Göring
Jochen Harant
Dieter Rautenbach
Ingo Schiermeyer
|
|
+
|
Efficiency in exponential time for domination-type problems
|
2008
|
Ingo Schiermeyer
|
|
+
|
None
|
2008
|
Guantao Chen
Ralph J. Faudree
Xuechao Li
Ingo Schiermeyer
|
|
+
|
On the circumference of a graph and its complement
|
2008
|
Ralph J. Faudree
Linda Lesniak
Ingo Schiermeyer
|
|
+
|
Non‐path spectrum sets
|
2008
|
Guantao Chen
Ralph J. Faudree
Xuechao Li
Ingo Schiermeyer
|
|
+
|
Algorithmic bounds for the chromatic number†
|
2008
|
Ingo Schiermeyer
|
|
+
PDF
Chat
|
The independence number in graphs of maximum degree three
|
2007
|
Jochen Harant
Michael A. Henning
Dieter Rautenbach
Ingo Schiermeyer
|
|
+
|
Locally dense independent sets in regular graphs of large girth
|
2007
|
Frank Göring
Jochen Harant
Dieter Rautenbach
Ingo Schiermeyer
|
|
+
|
On the complexity of 4-coloring graphs without long induced paths
|
2007
|
Van Bang Lê
Bert Randerath
Ingo Schiermeyer
|
|
+
|
Rainbows in the Hypercube
|
2007
|
Maria Axenovich
Heiko Harborth
Arnfried Kemnitz
Meinhard Möller
Ingo Schiermeyer
|
|
+
PDF
Chat
|
New sufficient conditions for hamiltonian and pancyclic graphs
|
2007
|
Ingo Schiermeyer
Mariusz Woźniak
|
|
+
|
Chvátal Erdős condition and 2-factors with a specyfied number of components
|
2007
|
Guantao Chen
Ken‐ichi Kawarabayashi
Katsuhiro Ota
Akira Saito
Ingo Schiermeyer
|
|
+
PDF
Chat
|
A new upper bound for the chromatic number of a graph
|
2007
|
Ingo Schiermeyer
|
|
+
|
[r,s,t]-colourings of paths
|
2007
|
Michele Villa
Ingo Schiermeyer
|
|
+
|
On Reed’s Conjecture about ω,Δ and χ
|
2006
|
Bert Randerath
Ingo Schiermeyer
|
|
+
|
Independence number and vertex-disjoint cycles
|
2006
|
Yoshimi Egawa
Hikoe Enomoto
Stanislav Jendrol’
Katsuhiro Ota
Ingo Schiermeyer
|
|
+
|
Degree conditions for hamiltonicity: Counting the number of missing edges
|
2006
|
Ralph J. Faudree
R. H. Schelp
Akira Saito
Ingo Schiermeyer
|
|
+
|
Upper bounds for the chromatic number of a graph
|
2006
|
Ingo Schiermeyer
|
|
+
|
Extremal Problems for Imbalanced Edges
|
2006
|
Dieter Rautenbach
Ingo Schiermeyer
|
|
+
PDF
Chat
|
Chvátal-Erdös condition and pancyclism
|
2006
|
Evelyne Flandrin
Hao Li
Antoni Marczyk
Ingo Schiermeyer
Mariusz Woźniak
|
|
+
PDF
Chat
|
A lower bound on the independence number of a graph in terms of degrees
|
2006
|
Jochen Harant
Ingo Schiermeyer
|
|
+
PDF
Chat
|
An Asymptotic Result for the Path Partition Conjecture
|
2005
|
Marietjie Frick
Ingo Schiermeyer
|
|
+
PDF
Chat
|
Ramsey ($K_{1,2},K_3$)-Minimal Graphs
|
2005
|
Mieczysław Borowiecki
Ingo Schiermeyer
Elżbieta Sidorowicz
|
|
+
|
Ramsey (K 1;2 ;K 3 )-minimal graphs
|
2005
|
Mieczysław Borowiecki
Ingo Schiermeyer
Elżbieta Sidorowicz
|
|
+
PDF
Chat
|
The Cycle-Complete Graph Ramsey Number r(C<sub>5</sub>, K<sub>7</sub>)
|
2005
|
Ingo Schiermeyer
|
|
+
|
Rainbow numbers for matchings and complete graphs
|
2004
|
Ingo Schiermeyer
|
|
+
|
Cycle lengths and chromatic number of graphs
|
2004
|
Peter Mihók
Ingo Schiermeyer
|
|
+
PDF
Chat
|
Vertex Colouring and Forbidden Subgraphs ? A Survey
|
2004
|
Bert Randerath
Ingo Schiermeyer
|
|
+
|
All cycle-complete graph Ramsey numbers r(C m , K 6 )
|
2003
|
Ingo Schiermeyer
|
|
+
|
All cycle‐complete graph Ramsey numbers <i>r</i>(<i>C<sub>m</sub></i>, <i>K</i><sub>6</sub>)
|
2003
|
Ingo Schiermeyer
|
|
+
|
3-Colorability ∈P for P6-free graphs
|
2003
|
Bert Randerath
Ingo Schiermeyer
|
|
+
|
0-Dual Closures for Several Classes of Graphs
|
2003
|
Ahmed Ainouche
Ingo Schiermeyer
|
|
+
|
None
|
2003
|
Yoshimi Egawa
Hikoe Enomoto
Ralph J. Faudree
Hao Li
Ingo Schiermeyer
|
|
+
|
Two‐factors each component of which contains a specified vertex
|
2003
|
Yoshimi Egawa
Hikoe Enomoto
Ralph J. Faudree
Hao Li
Ingo Schiermeyer
|
|
+
|
None
|
2003
|
Ralph J. Faudree
Ronald J. Gould
A.V. Kostochka
Linda Lesniak
Ingo Schiermeyer
Akira Saito
|
|
+
|
Degree conditions for <i>k</i>‐ordered hamiltonian graphs
|
2003
|
Ralph J. Faudree
Ronald J. Gould
Alexandr Kostochka
Linda Lesniak
Ingo Schiermeyer
Akira Saito
|
|
+
PDF
Chat
|
The Ramsey number r(C<sub>7</sub>,C<sub>7</sub>,C<sub>7</sub>)
|
2003
|
Ralph J. Faudree
Annette Schelten
Ingo Schiermeyer
|
|
+
|
Longest Paths and Longest Cycles in Graphs with Large Degree Sums
|
2002
|
Ingo Schiermeyer
Meike Tewes
|
|
+
|
Forbidden subgraphs implying the MIN-algorithm gives a maximum independent set
|
2002
|
Jochen Harant
Zdeněk Ryjáček
Ingo Schiermeyer
|
|
+
|
Vertex pancyclic graphs
|
2002
|
Bert Randerath
Ingo Schiermeyer
Meike Tewes
Lutz Volkmann
|
|
+
|
A note on Brooks' theorem for triangle-free graphs
|
2002
|
Bert Randerath
Ingo Schiermeyer
|
|
+
|
On a Max-min Problem Concerning Weights of Edges
|
2001
|
Stanislav Jendrol’
Ingo Schiermeyer
|
|
+
|
On the independence number of a graph in terms of order and size
|
2001
|
Jochen Harant
Ingo Schiermeyer
|
|
+
|
None
|
2001
|
Jochen Harant
Margit Voigt
Stanislav Jendrol’
Bert Randerath
Zdeněk Ryjáček
Ingo Schiermeyer
|
|
+
PDF
Chat
|
On the stability for pancyclicity
|
2001
|
Ingo Schiermeyer
|
|
+
|
On weights of induced paths and cycles in claw-free andK1,r-free graphs
|
2001
|
Jochen Harant
Margit Voigt
Stanislav Jendrol’
Bert Randerath
Z. Ryj� ek
Ingo Schiermeyer
|
|
+
|
On quadrilaterals in a graph
|
1999
|
Bert Randerath
Ingo Schiermeyer
Hong Wang
|
|
+
|
3-colored Ramsey Numbers of Odd Cycles
|
1999
|
Annette Schelten
Ingo Schiermeyer
Ralph J. Faudree
|
|
+
|
Forbidden subgraphs, stability and hamiltonicity
|
1999
|
Jan Brousek
Zdeněk Ryjáček
Ingo Schiermeyer
|
|
+
|
Forbidden subgraphs, stability and hamiltonicity
|
1999
|
Jan Brousek
Zdeněk Ryjáček
Ingo Schiermeyer
|
|
+
|
Colouring graphs with prescribed induced cycle lengths
|
1999
|
Ingo Schiermeyer
Bert Randerath
|
|
+
|
Ramsey numbers r(K3, G) for G ≅ K7 − 2P2 and G ≅ K7 − 3P2
|
1998
|
Annette Schelten
Ingo Schiermeyer
|
|
+
|
2-factors and hamiltonicity
|
1998
|
Zdeněk Ryjáček
Ingo Schiermeyer
|
|
+
|
Approximating maximum independent set in k-clique-free graphs
|
1998
|
Ingo Schiermeyer
|
|
+
|
Small cycles in Hamiltonian graphs
|
1997
|
Uwe Schelten
Ingo Schiermeyer
|
|
+
|
Ramsey numbers r(K3, G) for connected graphs G of order seven
|
1997
|
Annette Schelten
Ingo Schiermeyer
|
|
+
|
Dirac's minimum degree condition restricted to claws
|
1997
|
Hajo Broersma
Zdeněk Ryjáček
Ingo Schiermeyer
|
|
+
|
Toughness and hamiltonicity in almost claw-free graphs
|
1996
|
Hajo Broersma
Zdeněk Ryjáček
Ingo Schiermeyer
|
|
+
PDF
Chat
|
Toughness and hamiltonicity in almost claw-free graphs
|
1996
|
Hajo Broersma
Z. Ryj� ek
Ingo Schiermeyer
|
|
+
|
Unifying results on Hamiltonian Claw-Free graphs
|
1996
|
Hajo Broersma
Zdeněk Ryjáček
Ingo Schiermeyer
|
|
+
|
Insertible vertices, neighborhood intersections, and hamiltonicity
|
1995
|
Ahmed Ainouche
Ingo Schiermeyer
|
|
+
|
On the independence number in K1, r+1-free graphs
|
1995
|
Zdeněk Ryjáček
Ingo Schiermeyer
|
|
+
PDF
Chat
|
The flower conjecture in special classes of graphs
|
1995
|
Zdeněk Ryjáček
Ingo Schiermeyer
|
|
+
PDF
Chat
|
Problems remaining NP-complette for sparse or dense graphs
|
1995
|
Ingo Schiermeyer
|
|
+
|
Dirac's minimum degree condition restricted to claws
|
1995
|
Hajo Broersma
Zdeněk Ryjáček
Ingo Schiermeyer
|
|
+
|
Subgraphs, closures and hamiltonicity
|
1994
|
Hajo Broersma
Ingo Schiermeyer
|
|
+
|
A closure concept based on neighborhood unions of independent triples
|
1994
|
Hajo Broersma
Ingo Schiermeyer
|
|
+
|
Computation of the 0-dual closure for hamiltonian graphs
|
1993
|
Ingo Schiermeyer
|
|
+
|
Toughness and hamiltonicity in almost claw-free graphs
|
1993
|
Hajo Broersma
Zdeněk Ryjáček
Ingo Schiermeyer
|
|
+
|
Subgraphs, closures and hamiltonicity
|
1991
|
Hajo Broersma
Ingo Schiermeyer
|
|
+
|
A fast sequential and parallel algorithm for the computation of the k-closure of a graph
|
1990
|
Ingo Schiermeyer
|
|
+
|
GENERALIZING BONDY'S THEOREM ON SUFFICIENT CONDITIONS FOR HAMILTONIAN PROPERTIES
|
1980
|
Arnfried Kemnitz
Ingo Schiermeyer
Anika Fricke
|