default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDIngo Schiermeyer
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2024
[j149]Trung Duy Doan, Thi Thanh Chau Do
, Ingo Schiermeyer:
Graphs with large (1,2)-rainbow connection numbers. Appl. Math. Comput. 479: 128886 (2024)- [j148]Trung Duy Doan, Thi Thanh Chau Do, Pham Hoang Ha, Ngoc Diep Pham, Ingo Schiermeyer:
The conflict-free connection number and the minimum degree-sum of graphs. Appl. Math. Comput. 482: 128981 (2024) - [j147]Zhiqiang Ma, Yaping Mao, Ingo Schiermeyer, Meiqin Wei:
Complete bipartite graphs without small rainbow subgraphs. Discret. Appl. Math. 346: 248-262 (2024) - [j146]Christoph Brause, Trung Duy Doan, Ingo Schiermeyer:
The proper 2-connection number of several graph classes. Discret. Appl. Math. 359: 34-44 (2024) - [j145]Zhiwei Guo, Christoph Brause, Maximilian Geißer, Ingo Schiermeyer:
Compatible Spanning Circuits and Forbidden Induced Subgraphs. Graphs Comb. 40(1): 15 (2024) - [j144]Ping Li, Yaping Mao, Ingo Schiermeyer, Yifan Yao:
Gallai-Ramsey Numbers for Paths. Graphs Comb. 40(6): 115 (2024) - 2023
- [j143]Yaping Mao, Zhao Wang, Colton Magnant, Ingo Schiermeyer:
Gallai-Ramsey numbers for fans. Discret. Math. 346(5): 113338 (2023) - [j142]Christoph Brause, Stanislav Jendrol', Ingo Schiermeyer:
Loose Edge-Connection of Graphs. Graphs Comb. 39(4): 79 (2023) - 2022
- [j141]Christoph Brause, Maximilian Geißer, Ingo Schiermeyer:
Homogeneous sets, clique-separators, critical graphs, and optimal χ-binding functions. Discret. Appl. Math. 320: 211-222 (2022) - [j140]Trung Duy Doan, Ingo Schiermeyer:
The proper 2-connection number and size of graphs. Discret. Appl. Math. 320: 296-303 (2022) - [j139]Christoph Brause, Trung Duy Doan, Premysl Holub, Adam Kabela, Zdenek Ryjácek, Ingo Schiermeyer, Petr Vrána:
Forbidden induced subgraphs for perfectness of claw-free graphs of independence number at least 4. Discret. Math. 345(6): 112837 (2022) - [j138]Yaping Mao, Zhao Wang, Colton Magnant, Ingo Schiermeyer:
Ramsey and Gallai-Ramsey Number for Wheels. Graphs Comb. 38(2): 42 (2022) - [j137]Trung Duy Doan, Pham Hoang Ha, Ingo Schiermeyer:
The Conflict-Free Vertex-Connection Number and Degree Conditions of Graphs. Graphs Comb. 38(5): 157 (2022) - [j136]Colton Magnant, Ingo Schiermeyer:
Gallai-Ramsey number for K 5 ${K}_{5}$. J. Graph Theory 101(3): 455-492 (2022) - 2021
- [j135]Trung Duy Doan, Ingo Schiermeyer:
Conflict-free vertex connection number at most 3 and size of graphs. Discuss. Math. Graph Theory 41(2): 617-632 (2021) - [j134]Trung Duy Doan, Ingo Schiermeyer:
Proper rainbow connection number of graphs. Discuss. Math. Graph Theory 41(3): 809-826 (2021) - [j133]Christoph Brause, Stanislav Jendrol', Ingo Schiermeyer:
From Colourful to Rainbow Paths in Graphs: Colouring the Vertices. Graphs Comb. 37(5): 1823-1839 (2021) - [j132]Trung Duy Doan, Ingo Schiermeyer:
Conflict-Free Connection Number and Size of Graphs. Graphs Comb. 37(5): 1859-1871 (2021) - 2020
- [j131]Yaping Mao, Zhao Wang, Colton Magnant, Ingo Schiermeyer:
Ramsey and Gallai-Ramsey numbers for stars with extra independent edges. Discret. Appl. Math. 285: 153-172 (2020) - [j130]Henry Liu, Colton Magnant, Akira Saito, Ingo Schiermeyer, Yongtang Shi:
Gallai-Ramsey number for K 4. J. Graph Theory 94(2): 192-205 (2020)
2010 – 2019
- 2019
- [j129]Christoph Brause, Bert Randerath, Ingo Schiermeyer, Elkin Vumar:
On the chromatic number of 2K2-free graphs. Discret. Appl. Math. 253: 14-24 (2019) - [j128]Ingo Schiermeyer:
Maximum independent sets near the upper bound. Discret. Appl. Math. 266: 186-190 (2019) - [j127]Christoph Brause, Premysl Holub, Adam Kabela, Zdenek Ryjácek, Ingo Schiermeyer, Petr Vrána:
On forbidden induced subgraphs for K1, 3-free perfect graphs. Discret. Math. 342(6): 1602-1608 (2019) - [j126]Ingo Schiermeyer, Bert Randerath:
Polynomial χ -Binding Functions and Forbidden Induced Subgraphs: A Survey. Graphs Comb. 35(1): 1-31 (2019) - 2018
- [j125]Christoph Brause, Michael A. Henning, Kenta Ozeki, Ingo Schiermeyer, Elkin Vumar:
On upper bounds for the independent transversal domination number. Discret. Appl. Math. 236: 66-72 (2018) - [j124]Christoph Brause, Stanislav Jendrol', Ingo Schiermeyer:
Odd connection and odd vertex-connection of graphs. Discret. Math. 341(12): 3500-3512 (2018) - [j123]Hong Chang, Trung Duy Doan, Zhong Huang, Stanislav Jendrol', Xueliang Li, Ingo Schiermeyer:
Graphs with Conflict-Free Connection Number Two. Graphs Comb. 34(6): 1553-1563 (2018) - 2017
- [j122]Christoph Brause, Dieter Rautenbach, Ingo Schiermeyer:
Local connectivity, local degree conditions, some forbidden induced subgraphs, and cycle extendability. Discret. Math. 340(4): 596-606 (2017) - [j121]Susan A. van Aardt, Christoph Brause, Alewyn P. Burger, Marietjie Frick, Arnfried Kemnitz, Ingo Schiermeyer:
Proper connection and size of graphs. Discret. Math. 340(11): 2673-2677 (2017) - [j120]Christoph Brause, Ngoc Chi Lê, Ingo Schiermeyer:
On sequential heurestic methods for the maximum independent set problem. Discuss. Math. Graph Theory 37(2): 415-426 (2017) - [j119]Christoph Brause, Trung Duy Doan, Ingo Schiermeyer:
Minimum Degree Conditions for the Proper Connection Number of Graphs. Graphs Comb. 33(4): 833-843 (2017) - 2016
- [j118]Christoph Brause, Bert Randerath, Dieter Rautenbach, Ingo Schiermeyer:
A lower bound on the independence number of a graph in terms of degrees and local clique sizes. Discret. Appl. Math. 209: 59-67 (2016) - [j117]Arnfried Kemnitz, Ingo Schiermeyer:
Sufficient conditions for 2-rainbow connected graphs. Discret. Appl. Math. 209: 247-250 (2016) - [j116]Premysl Holub, Zdenek Ryjácek, Ingo Schiermeyer, Petr Vrána:
Characterizing forbidden pairs for rainbow connection in graphs with minimum degree 2. Discret. Math. 339(2): 1058-1068 (2016) - [j115]Christoph Brause, Ingo Schiermeyer:
Kernelization of the 3-path vertex cover problem. Discret. Math. 339(7): 1935-1939 (2016) - [j114]Ingo Schiermeyer:
Chromatic number of P5-free graphs: Reed's conjecture. Discret. Math. 339(7): 1940-1943 (2016) - [j113]Mirko Hornák, Stanislav Jendrol', Ingo Schiermeyer:
On the maximum weight of a dense connected graph of given order and size. Discret. Math. 339(7): 1978-1984 (2016) - [j112]Rafal Kalinowski, Monika Pilsniak, Ingo Schiermeyer, Mariusz Wozniak:
Dense arbitrarily partitionable graphs. Discuss. Math. Graph Theory 36(1): 5-22 (2016) - [j111]Christoph Brause, Trung Duy Doan, Ingo Schiermeyer:
Proper connection number 2, connectivity, and forbidden subgraphs. Electron. Notes Discret. Math. 55: 105-108 (2016) - [j110]Christoph Brause, Trung Duy Doan, Ingo Schiermeyer:
On the minimum degree and the proper connection number of graphs. Electron. Notes Discret. Math. 55: 109-112 (2016) - [j109]Christoph Brause, Trung Duy Doan, Ingo Schiermeyer:
On the chromatic number of (P5, K2, t)-free graphs. Electron. Notes Discret. Math. 55: 127-130 (2016) - [j108]Binlong Li, Ingo Schiermeyer:
On Star-Wheel Ramsey Numbers. Graphs Comb. 32(2): 733-739 (2016) - [j107]Mirko Hornák, Stanislav Jendrol', Ingo Schiermeyer:
On the Maximum Weight of a Sparse Connected Graph of Given Order and Size. Graphs Comb. 32(3): 997-1012 (2016) - 2015
- [j106]Premysl Holub, Zdenek Ryjácek, Ingo Schiermeyer:
On forbidden subgraphs and rainbow connection in graphs with minimum degree 2. Discret. Math. 338(3): 1-8 (2015) - [j105]Ngoc Chi Lê, Christoph Brause, Ingo Schiermeyer:
New sufficient conditions for α-redundant vertices. Discret. Math. 338(10): 1674-1680 (2015) - [j104]Premysl Holub, Zdenek Ryjácek, Ingo Schiermeyer, Petr Vrána:
Rainbow connection and forbidden subgraphs. Discret. Math. 338(10): 1706-1713 (2015) - [j103]Christoph Brause, Ngoc Chi Lê, Ingo Schiermeyer:
The Maximum Independent Set Problem in Subclasses of Subcubic Graphs. Discret. Math. 338(10): 1766-1778 (2015) - [j102]Xueliang Li, Ingo Schiermeyer, Kang Yang, Yan Zhao:
Graphs with 3-rainbow index n-1 and n-2. Discuss. Math. Graph Theory 35(1): 105-120 (2015) - [j101]Christoph Brause, Ngoc Chi Lê, Ingo Schiermeyer:
Extending the Max Algorithm for maximum independent set. Discuss. Math. Graph Theory 35(2): 365-386 (2015) - [j100]Xueliang Li, Ingo Schiermeyer, Kang Yang, Yan Zhao:
Graphs with 4-rainbow index 3 and n-1. Discuss. Math. Graph Theory 35(2): 387-398 (2015) - [j99]Christoph Brause, Ingo Schiermeyer, Premysl Holub, Zdenek Ryjácek, Petr Vrána, Rastislav Krivos-Bellus:
4-colorability of P6-free graphs. Electron. Notes Discret. Math. 49: 37-42 (2015) - [j98]Ngoc Chi Lê, Christoph Brause, Ingo Schiermeyer:
The Maximum Independent Set Problem in Subclasses of Si, j, k-Free Graphs. Electron. Notes Discret. Math. 49: 43-49 (2015) - [j97]Susan A. van Aardt, Alewyn P. Burger, Marietjie Frick, Arnfried Kemnitz, Ingo Schiermeyer:
Hypohamiltonian Oriented Graphs of All Possible Orders. Graphs Comb. 31(6): 1821-1831 (2015) - [j96]Ingo Schiermeyer, Roman Soták:
Rainbow Numbers for Graphs Containing Small Cycles. Graphs Comb. 31(6): 1985-1991 (2015) - [j95]Mirko Hornák, Stanislav Jendrol', Ingo Schiermeyer, Roman Soták:
Rainbow Numbers for Cycles in Plane Triangulations. J. Graph Theory 78(4): 248-257 (2015) - 2014
- [j94]Paul Dorbec, Ingo Schiermeyer, Elzbieta Sidorowicz, Éric Sopena:
Rainbow connection in oriented graphs. Discret. Appl. Math. 179: 69-78 (2014) - [j93]Stanislav Jendrol', Ingo Schiermeyer, Jianhua Tu:
Rainbow numbers for matchings in plane triangulations. Discret. Math. 331: 158-164 (2014) - 2013
- [j92]Ingo Schiermeyer:
On the minimum rainbow subgraph number of a graph. Ars Math. Contemp. 6(1): 83-88 (2013) - [j91]Ingo Schiermeyer:
On minimally rainbow k-connected graphs. Discret. Appl. Math. 161(4-5): 702-705 (2013) - [j90]Ingo Schiermeyer:
Rainbow connection and minimum degree. Discret. Appl. Math. 161(12): 1784-1787 (2013) - [j89]Jan Ekstein, Premysl Holub, Tomás Kaiser, Maria Koch, Stephan Matos Camacho, Zdenek Ryjácek, Ingo Schiermeyer:
The rainbow connection number of 2-connected graphs. Discret. Math. 313(19): 1884-1892 (2013) - [j88]Mirko Hornák, Stanislav Jendrol', Ingo Schiermeyer:
On maximum weight of a bipartite graph of given order and size. Discuss. Math. Graph Theory 33(1): 147-165 (2013) - [j87]Arnfried Kemnitz, Jakub Przybylo, Ingo Schiermeyer, Mariusz Wozniak:
Rainbow connection in sparse graphs. Discuss. Math. Graph Theory 33(1): 181-192 (2013) - [j86]Xueliang Li, Mengmeng Liu, Ingo Schiermeyer:
Rainbow connection number of dense graphs. Discuss. Math. Graph Theory 33(3): 603-611 (2013) - 2012
- [j85]Stanislav Jendrol', Tomás Kaiser, Zdenek Ryjácek, Ingo Schiermeyer:
A Dirac theorem for trestles. Discret. Math. 312(12-13): 2000-2004 (2012) - [j84]Arnfried Kemnitz, Ingo Schiermeyer:
Improved degree conditions for Hamiltonian properties. Discret. Math. 312(14): 2140-2145 (2012) - [j83]Mirko Hornák, Antoni Marczyk, Ingo Schiermeyer, Mariusz Wozniak:
Dense Arbitrarily Vertex Decomposable Graphs. Graphs Comb. 28(6): 807-821 (2012) - [j82]Jochen Harant, Arnfried Kemnitz, Akira Saito, Ingo Schiermeyer:
Closures, cycles, and paths. J. Graph Theory 69(3): 314-323 (2012) - 2011
- [j81]Jun Fujisawa, Shinya Fujita, Michael D. Plummer, Akira Saito, Ingo Schiermeyer:
A pair of forbidden subgraphs and perfect matchings in graphs of high connectivity. Comb. 31(6): 703-723 (2011) - [j80]Michael A. Henning, Ingo Schiermeyer, Anders Yeo:
A New Bound on the Domination Number of Graphs with Minimum Degree Two. Electron. J. Comb. 18(1) (2011) - [j79]Jun Fujisawa, Akira Saito, Ingo Schiermeyer:
Closure for spanning trees and distant area. Discuss. Math. Graph Theory 31(1): 143-159 (2011) - [j78]Arnfried Kemnitz, Ingo Schiermeyer:
Graphs with rainbow connection number two. Discuss. Math. Graph Theory 31(2): 313-320 (2011) - [j77]Ingo Schiermeyer:
Bounds for the rainbow connection number of graphs. Discuss. Math. Graph Theory 31(2): 387-395 (2011) - [j76]Maria Koch, Stephan Matos Camacho, Ingo Schiermeyer:
Algorithmic approaches for the minimum rainbow subgraph problem. Electron. Notes Discret. Math. 38: 765-770 (2011) - [j75]Ján Katrenic, Ingo Schiermeyer:
Improved approximation bounds for the minimum rainbow subgraph problem. Inf. Process. Lett. 111(3): 110-114 (2011) - [j74]Frantisek Kardos, Ján Katrenic, Ingo Schiermeyer:
On computing the minimum 3-path vertex cover and dissociation number of graphs. Theor. Comput. Sci. 412(50): 7009-7017 (2011) - 2010
- [j73]Sarah Artmann, Frank Göring, Jochen Harant, Dieter Rautenbach, Ingo Schiermeyer:
Random Procedures for Dominating Sets in Graphs. Electron. J. Comb. 17(1) (2010) - [j72]Bert Randerath, Ingo Schiermeyer:
On maximum independent sets in P5-free graphs. Discret. Appl. Math. 158(9): 1041-1044 (2010) - [j71]Anja Kohl, Ingo Schiermeyer:
Some results on Reed's Conjecture about omega, Delta, and chi with respect to alpha. Discret. Math. 310(9): 1429-1438 (2010) - [j70]Jochen Harant, Dieter Rautenbach, Peter Recht, Ingo Schiermeyer, Eva-Maria Sprengel:
Packing disjoint cycles over vertex cuts. Discret. Math. 310(13-14): 1974-1978 (2010) - [j69]Stephan Matos Camacho, Ingo Schiermeyer, Zsolt Tuza:
Approximation algorithms for the minimum rainbow subgraph problem. Discret. Math. 310(20): 2666-2670 (2010) - [j68]Ingo Schiermeyer, Martin Sonntag, Hanns-Martin Teichert:
Structural Properties and Hamiltonicity of Neighborhood Graphs. Graphs Comb. 26(3): 433-456 (2010) - [j67]Christian Löwenstein, Dieter Rautenbach, Ingo Schiermeyer:
Cycle length parities and the chromatic number. J. Graph Theory 64(3): 210-218 (2010) - [c9]Ingo Schiermeyer:
Progress on Rainbow Connection. CTW 2010: 153-156
2000 – 2009
- 2009
- [j66]Shinya Fujita, Atsushi Kaneko, Ingo Schiermeyer, Kazuhiro Suzuki:
A Rainbow k-Matching in the Complete Graph with r Colors. Electron. J. Comb. 16(1) (2009) - [j65]Stephan Matos Camacho, Ingo Schiermeyer:
Colourings of graphs with two consecutive odd cycle lengths. Discret. Math. 309(15): 4916-4919 (2009) - [j64]Ralph J. Faudree, Linda M. Lesniak, Ingo Schiermeyer:
On the circumference of a graph and its complement. Discret. Math. 309(19): 5891-5893 (2009) - [j63]Frank Göring, Jochen Harant, Dieter Rautenbach, Ingo Schiermeyer:
On F-independence in graphs. Discuss. Math. Graph Theory 29(2): 377-383 (2009) - [c8]Ingo Schiermeyer:
Rainbow Connection in Graphs with Minimum Degree Three. IWOCA 2009: 432-437 - 2008
- [j62]Ingo Schiermeyer:
Efficiency in exponential time for domination-type problems. Discret. Appl. Math. 156(17): 3291-3297 (2008) - [j61]Jochen Harant, Michael A. Henning, Dieter Rautenbach, Ingo Schiermeyer:
The independence number in graphs of maximum degree three. Discret. Math. 308(23): 5829-5833 (2008) - [j60]Guantao Chen, Ralph J. Faudree, Xuechao Li, Ingo Schiermeyer:
Non-path spectrum sets. J. Graph Theory 58(4): 329-350 (2008) - 2007
- [j59]Ralph J. Faudree, Richard H. Schelp, Akira Saito, Ingo Schiermeyer:
Degree conditions for hamiltonicity: Counting the number of missing edges. Discret. Math. 307(7-8): 873-877 (2007) - [j58]Yoshimi Egawa, Hikoe Enomoto, Stanislav Jendrol', Katsuhiro Ota, Ingo Schiermeyer:
Independence number and vertex-disjoint cycles. Discret. Math. 307(11-12): 1493-1498 (2007) - [j57]Ingo Schiermeyer, Mariusz Wozniak:
New sufficient conditions for hamiltonian and pancyclic graphs. Discuss. Math. Graph Theory 27(1): 29-38 (2007) - [j56]Ingo Schiermeyer:
A new upper bound for the chromatic number of a graph. Discuss. Math. Graph Theory 27(1): 137-142 (2007) - [j55]Guantao Chen, Ronald J. Gould, Ken-ichi Kawarabayashi, Katsuhiro Ota, Akira Saito, Ingo Schiermeyer:
Chvátal Erdós condition and 2-factors with a specyfied number of components. Discuss. Math. Graph Theory 27(3): 401-407 (2007) - [j54]Maria Axenovich, Heiko Harborth, Arnfried Kemnitz, Meinhard Möller, Ingo Schiermeyer:
Rainbows in the Hypercube. Graphs Comb. 23(2): 123-133 (2007) - [j53]Van Bang Le, Bert Randerath, Ingo Schiermeyer:
On the complexity of 4-coloring graphs without long induced paths. Theor. Comput. Sci. 389(1-2): 330-335 (2007) - 2006
- [j52]Evelyne Flandrin, Hao Li, Antoni Marczyk, Ingo Schiermeyer, Mariusz Wozniak:
Chvátal-Erdös condition and pancyclism. Discuss. Math. Graph Theory 26(2): 335-342 (2006) - [j51]Jochen Harant, Ingo Schiermeyer:
A lower bound on the independence number of a graph in terms of degrees. Discuss. Math. Graph Theory 26(3): 431-437 (2006) - [j50]Ingo Schiermeyer:
Upper bounds for the chromatic number of a graph. Electron. Notes Discret. Math. 25: 147-148 (2006) - [j49]Dieter Rautenbach, Ingo Schiermeyer:
Extremal Problems for Imbalanced Edges. Graphs Comb. 22(1): 103-111 (2006) - 2005
- [j48]Mieczyslaw Borowiecki, Ingo Schiermeyer, Elzbieta Sidorowicz:
Ramsey (K1,2,K3)-Minimal Graphs. Electron. J. Comb. 12 (2005) - [j47]Marietjie Frick, Ingo Schiermeyer:
An Asymptotic Result for the Path Partition Conjecture. Electron. J. Comb. 12 (2005) - [j46]Ingo Schiermeyer:
The Cycle-Complete Graph Ramsey Number r(C5, K7). Discuss. Math. Graph Theory 25(1-2): 129-139 (2005) - 2004
- [j45]Bert Randerath, Ingo Schiermeyer:
3-Colorability in P for P6-free graphs. Discret. Appl. Math. 136(2-3): 299-313 (2004) - [j44]Peter Mihók, Ingo Schiermeyer:
Cycle lengths and chromatic number of graphs. Discret. Math. 286(1-2): 147-149 (2004) - [j43]Ingo Schiermeyer:
Rainbow numbers for matchings and complete graphs. Discret. Math. 286(1-2): 157-162 (2004) - [j42]Bert Randerath, Ingo Schiermeyer:
Vertex Colouring and Forbidden Subgraphs - A Survey. Graphs Comb. 20(1): 1-40 (2004) - 2003
- [j41]Ralph J. Faudree, Annette Schelten, Ingo Schiermeyer:
The Ramsey number r(C7, C7, C7). Discuss. Math. Graph Theory 23(1): 141-158 (2003) - [j40]Ahmed Ainouche, Ingo Schiermeyer:
0-Dual Closures for Several Classes of Graphs. Graphs Comb. 19(3): 297-307 (2003) - [j39]Ralph J. Faudree, Ronald J. Gould, Alexandr V. Kostochka, Linda M. Lesniak, Ingo Schiermeyer, Akira Saito:
Degree conditions for k-ordered hamiltonian graphs. J. Graph Theory 42(3): 199-210 (2003) - [j38]Yoshimi Egawa, Hikoe Enomoto, Ralph J. Faudree, Hao Li, Ingo Schiermeyer:
Two-factors each component of which contains a specified vertex. J. Graph Theory 43(3): 188-198 (2003) - [j37]Ingo Schiermeyer:
All cycle-complete graph Ramsey numbers r(Cm, K6). J. Graph Theory 44(4): 251-260 (2003) - 2002
- [j36]Bert Randerath, Ingo Schiermeyer:
A note on Brooks' theorem for triangle-free graphs. Australas. J Comb. 26: 3-10 (2002) - [j35]Bert Randerath, Ingo Schiermeyer, Meike Tewes, Lutz Volkmann:
Vertex pancyclic graphs. Discret. Appl. Math. 120(1-3): 219-237 (2002) - [j34]Bert Randerath, Ingo Schiermeyer, Meike Tewes:
Three-colourability and forbidden subgraphs. II: polynomial algorithms. Discret. Math. 251(1-3): 137-153 (2002) - [j33]Jochen Harant, Zdenek Ryjácek, Ingo Schiermeyer:
Forbidden subgraphs implying the MIN-algorithm gives a maximum independent set. Discret. Math. 256(1-2): 193-201 (2002) - [j32]Jochen Harant, Ingo Schiermeyer, Margit Voigt:
Preface. Discuss. Math. Graph Theory 22(1): 5-6 (2002) - [j31]Ingo Schiermeyer, Meike Tewes:
Longest Paths and Longest Cycles in Graphs with Large Degree Sums. Graphs Comb. 18(3): 633-643 (2002) - 2001
- [j30]Stanislav Jendrol', Ingo Schiermeyer:
On a Max-min Problem Concerning Weights of Edges. Comb. 21(3): 351-359 (2001) - [j29]Jochen Harant, Ingo Schiermeyer:
On the independence number of a graph in terms of order and size. Discret. Math. 232(1-3): 131-138 (2001) - [j28]Ingo Schiermeyer:
On the stability for pancyclicity. Discuss. Math. Graph Theory 21(2): 223-228 (2001) - [j27]Bert Randerath, Ingo Schiermeyer:
Colouring Graphs with Prescribed Induced Cycle Lengths. Discuss. Math. Graph Theory 21(2): 267-281 (2001) - [j26]Bert Randerath, Ingo Schiermeyer:
3-Colorability element oF P for p6-free Graphs. Electron. Notes Discret. Math. 8: 85-89 (2001) - [j25]Jochen Harant, Margit Voigt, Stanislav Jendrol', Bert Randerath, Zdenek Ryjácek, Ingo Schiermeyer:
On weights of induced paths and cycles in claw-free and K1, r-free graphs. J. Graph Theory 36(3): 131-143 (2001) - 2000
- [j24]Ingo Schiermeyer, Zsolt Tuza, Margit Voigt:
On-line rankings of graphs. Discret. Math. 212(1-2): 141-147 (2000) - [j23]Hajo Broersma, Zdenek Ryjácek, Ingo Schiermeyer:
Closure Concepts: A Survey. Graphs Comb. 16(1): 17-48 (2000)
1990 – 1999
- 1999
- [j22]Jan Brousek, Zdenek Ryjácek, Ingo Schiermeyer:
Forbidden subgraphs, stability and hamiltonicity. Discret. Math. 197-198: 143-155 (1999) - [j21]Bert Randerath, Ingo Schiermeyer, Hong Wang:
On quadrilaterals in a graph. Discret. Math. 203(1-3): 229-237 (1999) - [j20]Bert Randerath, Lutz Volkmann, Ingo Schiermeyer, Meike Tewes:
Vertex Pancyclic Graphs. Electron. Notes Discret. Math. 3: 166-170 (1999) - [j19]Annette Schelten, Ingo Schiermeyer, Ralph J. Faudree:
3-colored Ramsey Numbers of Odd Cycles. Electron. Notes Discret. Math. 3: 176-178 (1999) - [c7]Ingo Schiermeyer, Bert Randerath:
Colouring Graphs with Prescribed Induced Cycle Lengths. SODA 1999: 965-966 - [p1]Ingo Schiermeyer:
Linear und exponentiell wachsende Kaninchenpopulationen. Angewandte Mathematik, insbesondere Informatik 1999: 263-265 - 1998
- [j18]Thomas Böhme, Jochen Harant, Anja Pruchnewski, Ingo Schiermeyer:
A planarity criterion for cubic bipartite graphs. Discret. Math. 191(1-3): 31-43 (1998) - [j17]Zdenek Ryjácek, Ingo Schiermeyer:
2-factors and hamiltonicity. Discret. Math. 191(1-3): 171-177 (1998) - [j16]Annette Schelten, Ingo Schiermeyer:
Ramsey numbers r(K3, G) for G =~ K7 - 2P2 and G =~ K7 - 3P2. Discret. Math. 191(1-3): 191-196 (1998) - [c6]Ingo Schiermeyer:
Approximating Maximum Independent Set in k-Clique-Free Graphs. APPROX 1998: 159-168 - 1997
- [j15]Ralph J. Faudree, Zdenek Ryjácek, Ingo Schiermeyer:
Local connectivity and cycle xtension in claw-free graphs. Ars Comb. 47 (1997) - [j14]Annette Schelten, Ingo Schiermeyer:
Ramsey Numbers r(K3, G) for Connected Graphs G of Order Seven. Discret. Appl. Math. 79(1-3): 189-200 (1997) - [j13]Uwe Schelten, Ingo Schiermeyer:
Small Cycles in Hamiltonian Graphs. Discret. Appl. Math. 79(1-3): 201-211 (1997) - [j12]Haitze J. Broersma, Zdenek Ryjácek, Ingo Schiermeyer:
Dirac's minimum degree condition restricted to claws. Discret. Math. 167-168: 155-166 (1997) - [j11]Jan Kratochvíl, Ingo Schiermeyer:
On the computational complexity of (O, P)-partition problems. Discuss. Math. Graph Theory 17(2): 253-258 (1997) - 1996
- [j10]Haitze J. Broersma, Zdenek Ryjácek, Ingo Schiermeyer:
Toughness and hamiltonicity in almost claw-free graphs. J. Graph Theory 21(4): 431-439 (1996) - 1995
- [j9]Zdenek Ryjácek, Ingo Schiermeyer:
On the independence number in K1, r+1-free graphs. Discret. Math. 138(1-3): 365-374 (1995) - [j8]Ingo Schiermeyer:
Problems remaining NP-complette for sparse or dense graphs. Discuss. Math. Graph Theory 15(1): 33-41 (1995) - [j7]Zdenek Ryjácek, Ingo Schiermeyer:
The flower conjecture in special classes of graphs. Discuss. Math. Graph Theory 15(2): 179-184 (1995) - [j6]Ahmed Ainouche, Ingo Schiermeyer:
Insertible vertices, neighborhood intersections, and hamiltonicity. J. Graph Theory 20(2): 123-135 (1995) - [c5]Ingo Schiermeyer:
An Approximation Algorithm for 3-Colourability. WG 1995: 146-151 - 1994
- [j5]Hajo Broersma, Ingo Schiermeyer:
Subgraphs, Closures and Hamiltonicity. Discret. Appl. Math. 51(1-2): 39-46 (1994) - [j4]Haitze J. Broersma, Ingo Schiermeyer:
A closure concept based on neighborhood unions of independent triples. Discret. Math. 124(1-3): 37-47 (1994) - [j3]Ingo Schiermeyer:
The k-Satisfiability problem remains NP-complete for dense families. Discret. Math. 125(1-3): 343-346 (1994) - [j2]Peter Dankelmann, Thomas Niessen, Ingo Schiermeyer:
On Path-Tough Graphs. SIAM J. Discret. Math. 7(4): 571-584 (1994) - [c4]Ingo Schiermeyer:
Reverse-Fit: A 2-Optimal Algorithm for Packing Rectangles. ESA 1994: 290-299 - 1993
- [j1]Ingo Schiermeyer:
Computation of the 0-dual closure for hamiltonian graphs. Discret. Math. 111(1-3): 455-464 (1993) - [c3]Ingo Schiermeyer:
Deciding 3-Colourability in Less Than O(1.415^n) Steps. WG 1993: 177-188 - 1992
- [c2]Ingo Schiermeyer:
Solving 3-Satisfiability in Less Then 1, 579n Steps. CSL 1992: 379-394
1980 – 1989
- 1989
- [c1]Ingo Schiermeyer:
A Fast Sequential and Parallel Algorithm for the Computation of the k-Closure of a Graph. WG 1989: 211-217 - 1988
- [b1]Ingo Schiermeyer:
Algorithmen zum Auffinden längster Kreise in Graphen. RWTH Aachen University, Germany, 1988, pp. 1-154
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2025-03-05 20:52 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
