Christoph Brause

Publication Activity (10 Years)

Years Active: 2015-2024
Publications (10 Years): 37

Top Topics

Independent Set

Graph Theoretic

Top Venues

Discret. Appl. Math.

Electron. Notes Discret. Math.

Publications

Christoph Brause, Trung Duy Doan, Ingo Schiermeyer
The proper 2-connection number of several graph classes. Discret. Appl. Math. 359 (2024)
Zhiwei Guo, Christoph Brause, Maximilian Geißer, Ingo Schiermeyer
Compatible Spanning Circuits and Forbidden Induced Subgraphs. Graphs Comb. 40 (1) (2024)
Christoph Brause, Stanislav Jendrol', Ingo Schiermeyer
Loose Edge-Connection of Graphs. Graphs Comb. 39 (4) (2023)
Christoph Brause, Petr A. Golovach, Barnaby Martin, Pascal Ochem, Daniël Paulusma, Siani Smith
Acyclic, Star, and Injective Colouring: Bounding the Diameter. Electron. J. Comb. 29 (2) (2022)
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) (2022)
Christoph Brause, Jochen Harant, Florian Hörsch, Samuel Mohr
Spanning trees of smallest maximum degree in subdivisions of graphs. CoRR (2022)
Christoph Brause, Petr A. Golovach, Barnaby Martin, Daniël Paulusma, Siani Smith
-free graphs of bounded diameter. Theor. Comput. Sci. 930 (2022)
Christoph Brause, Maximilian Geißer, Ingo Schiermeyer
Homogeneous sets, clique-separators, critical graphs, and optimal χ-binding functions. Discret. Appl. Math. 320 (2022)
Christoph Brause, Stanislav Jendrol', Ingo Schiermeyer
From Colourful to Rainbow Paths in Graphs: Colouring the Vertices. Graphs Comb. 37 (5) (2021)
Christoph Brause, Petr A. Golovach, Barnaby Martin, Daniël Paulusma, Siani Smith
Acyclic, Star, and Injective Colouring: Bounding the Diameter. CoRR (2021)
Christoph Brause, Petr A. Golovach, Barnaby Martin, Daniël Paulusma, Siani Smith
Partitioning H-Free Graphs of Bounded Diameter. CoRR (2021)
Christoph Brause, Petr A. Golovach, Barnaby Martin, Daniël Paulusma, Siani Smith
Partitioning H-Free Graphs of Bounded Diameter. ISAAC (2021)
Christoph Brause, Petr A. Golovach, Barnaby Martin, Daniël Paulusma, Siani Smith
Acyclic, Star, and Injective Colouring: Bounding the Diameter. WG (2021)
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) (2019)
Christoph Brause, Bert Randerath, Ingo Schiermeyer, Elkin Vumar
On the chromatic number of 2K2-free graphs. Discret. Appl. Math. 253 (2019)
Christoph Brause, Stefan Ehard, Dieter Rautenbach
Bounds and extremal graphs for degenerate subsets, dynamic monopolies, and partial incentives. Discret. Math. 342 (7) (2019)
Christoph Brause, Michael A. Henning
Independent Domination in Bipartite Cubic Graphs. Graphs Comb. 35 (4) (2019)
Christoph Brause, Michael A. Henning, Kenta Ozeki, Ingo Schiermeyer, Elkin Vumar
On upper bounds for the independent transversal domination number. Discret. Appl. Math. 236 (2018)
Christoph Brause, Stanislav Jendrol', Ingo Schiermeyer
Odd connection and odd vertex-connection of graphs. Discret. Math. 341 (12) (2018)
Christoph Brause, Arnfried Kemnitz, Massimiliano Marangio, Anja Pruchnewski, Margit Voigt
Sum choice number of generalized θ-graphs. Discret. Math. 340 (11) (2017)
Christoph Brause, Dieter Rautenbach, Ingo Schiermeyer
Local connectivity, local degree conditions, some forbidden induced subgraphs, and cycle extendability. Discret. Math. 340 (4) (2017)
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) (2017)
Christoph Brause, Ngoc Chi Lê, Ingo Schiermeyer
On sequential heurestic methods for the maximum independent set problem. Discuss. Math. Graph Theory 37 (2) (2017)
Christoph Brause, Michael A. Henning, Marcin Krzywkowski
A characterization of trees with equal 2-domination and 2-independence numbers. Discret. Math. Theor. Comput. Sci. 19 (1) (2017)
Christoph Brause
A subexponential-time algorithm for the Maximum Independent Set Problem in Pt-free graphs. Discret. Appl. Math. 231 (2017)
Christoph Brause, Rastislav Krivos-Bellus
On a relation between k-path partition and k-path vertex cover. Discret. Appl. Math. 223 (2017)
Christoph Brause, Trung Duy Doan, Ingo Schiermeyer
Minimum Degree Conditions for the Proper Connection Number of Graphs. Graphs Comb. 33 (4) (2017)
Christoph Brause, Trung Duy Doan, Ingo Schiermeyer
)-free graphs. Electron. Notes Discret. Math. 55 (2016)
Christoph Brause, Trung Duy Doan, Ingo Schiermeyer
On the minimum degree and the proper connection number of graphs. Electron. Notes Discret. Math. 55 (2016)
Christoph Brause, Trung Duy Doan, Ingo Schiermeyer
Proper connection number 2, connectivity, and forbidden subgraphs. Electron. Notes Discret. Math. 55 (2016)
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 (2016)
Christoph Brause, Ingo Schiermeyer
Kernelization of the 3-path vertex cover problem. Discret. Math. 339 (7) (2016)
Christoph Brause, Ingo Schiermeyer, Premysl Holub, Zdenek Ryjácek, Petr Vrána, Rastislav Krivos-Bellus
-free graphs. Electron. Notes Discret. Math. 49 (2015)
Ngoc Chi Lê, Christoph Brause, Ingo Schiermeyer
-Free Graphs. Electron. Notes Discret. Math. 49 (2015)
Ngoc Chi Lê, Christoph Brause, Ingo Schiermeyer
New sufficient conditions for α-redundant vertices. Discret. Math. 338 (10) (2015)
Christoph Brause, Ngoc Chi Lê, Ingo Schiermeyer
Extending the Max Algorithm for maximum independent set. Discuss. Math. Graph Theory 35 (2) (2015)
Christoph Brause, Ngoc Chi Lê, Ingo Schiermeyer
The Maximum Independent Set Problem in Subclasses of Subcubic Graphs. Discret. Math. 338 (10) (2015)