Christoph Brause

37 papers B 2Journal 35
YearRankTypeTitle / Venue / Authors
2024 J jnl
Compatible Spanning Circuits and Forbidden Induced Subgraphs.
Graphs Comb.
Zhiwei Guo, Christoph Brause, Maximilian Geißer, Ingo Schiermeyer
2024 J jnl
The proper 2-connection number of several graph classes.
Discret. Appl. Math.
Christoph Brause, Trung Duy Doan, Ingo Schiermeyer
2023 J jnl
Loose Edge-Connection of Graphs.
Graphs Comb.
Christoph Brause, Stanislav Jendrol', Ingo Schiermeyer
2022 J jnl
Acyclic, Star, and Injective Colouring: Bounding the Diameter.
Electron. J. Comb.
Christoph Brause, Petr A. Golovach, Barnaby Martin, Pascal Ochem, Daniël Paulusma, Siani Smith
2022 J jnl
Forbidden induced subgraphs for perfectness of claw-free graphs of independence number at least 4.
Discret. Math.
Christoph Brause, Trung Duy Doan, Premysl Holub, Adam Kabela, Zdenek Ryjácek, Ingo Schiermeyer, Petr Vrána
2022 J jnl
Homogeneous sets, clique-separators, critical graphs, and optimal χ-binding functions.
Discret. Appl. Math.
Christoph Brause, Maximilian Geißer, Ingo Schiermeyer
2022 J jnl
Partitioning
Theor. Comput. Sci.
Christoph Brause, Petr A. Golovach, Barnaby Martin, Daniël Paulusma, Siani Smith
2022 J jnl
Spanning trees of smallest maximum degree in subdivisions of graphs.
CoRR
Christoph Brause, Jochen Harant, Florian Hörsch, Samuel Mohr
2021 B conf
Acyclic, Star, and Injective Colouring: Bounding the Diameter.
WG
Christoph Brause, Petr A. Golovach, Barnaby Martin, Daniël Paulusma, Siani Smith
2021 J jnl
Acyclic, Star, and Injective Colouring: Bounding the Diameter.
CoRR
Christoph Brause, Petr A. Golovach, Barnaby Martin, Daniël Paulusma, Siani Smith
2021 J jnl
From Colourful to Rainbow Paths in Graphs: Colouring the Vertices.
Graphs Comb.
Christoph Brause, Stanislav Jendrol', Ingo Schiermeyer
2021 B conf
Partitioning H-Free Graphs of Bounded Diameter.
ISAAC
Christoph Brause, Petr A. Golovach, Barnaby Martin, Daniël Paulusma, Siani Smith
2021 J jnl
Partitioning H-Free Graphs of Bounded Diameter.
CoRR
Christoph Brause, Petr A. Golovach, Barnaby Martin, Daniël Paulusma, Siani Smith
2019 J jnl
Bounds and extremal graphs for degenerate subsets, dynamic monopolies, and partial incentives.
Discret. Math.
Christoph Brause, Stefan Ehard, Dieter Rautenbach
2019 J jnl
Independent Domination in Bipartite Cubic Graphs.
Graphs Comb.
Christoph Brause, Michael A. Henning
2019 J jnl
On forbidden induced subgraphs for K1, 3-free perfect graphs.
Discret. Math.
Christoph Brause, Premysl Holub, Adam Kabela, Zdenek Ryjácek, Ingo Schiermeyer, Petr Vrána
2019 J jnl
On the chromatic number of 2K2-free graphs.
Discret. Appl. Math.
Christoph Brause, Bert Randerath, Ingo Schiermeyer, Elkin Vumar
2018 J jnl
Odd connection and odd vertex-connection of graphs.
Discret. Math.
Christoph Brause, Stanislav Jendrol', Ingo Schiermeyer
2018 J jnl
On upper bounds for the independent transversal domination number.
Discret. Appl. Math.
Christoph Brause, Michael A. Henning, Kenta Ozeki, Ingo Schiermeyer, Elkin Vumar
2017 J jnl
A characterization of trees with equal 2-domination and 2-independence numbers.
Discret. Math. Theor. Comput. Sci.
Christoph Brause, Michael A. Henning, Marcin Krzywkowski
2017 J jnl
A subexponential-time algorithm for the Maximum Independent Set Problem in Pt-free graphs.
Discret. Appl. Math.
Christoph Brause
2017 J jnl
Local connectivity, local degree conditions, some forbidden induced subgraphs, and cycle extendability.
Discret. Math.
Christoph Brause, Dieter Rautenbach, Ingo Schiermeyer
2017 J jnl
Minimum Degree Conditions for the Proper Connection Number of Graphs.
Graphs Comb.
Christoph Brause, Trung Duy Doan, Ingo Schiermeyer
2017 J jnl
On a relation between k-path partition and k-path vertex cover.
Discret. Appl. Math.
Christoph Brause, Rastislav Krivos-Bellus
2017 J jnl
On sequential heurestic methods for the maximum independent set problem.
Discuss. Math. Graph Theory
Christoph Brause, Ngoc Chi Lê, Ingo Schiermeyer
2017 J jnl
Proper connection and size of graphs.
Discret. Math.
Susan A. van Aardt, Christoph Brause, Alewyn P. Burger, Marietjie Frick, Arnfried Kemnitz, Ingo Schiermeyer
2017 J jnl
Sum choice number of generalized θ-graphs.
Discret. Math.
Christoph Brause, Arnfried Kemnitz, Massimiliano Marangio, Anja Pruchnewski, Margit Voigt
2016 J jnl
A lower bound on the independence number of a graph in terms of degrees and local clique sizes.
Discret. Appl. Math.
Christoph Brause, Bert Randerath, Dieter Rautenbach, Ingo Schiermeyer
2016 J jnl
Kernelization of the 3-path vertex cover problem.
Discret. Math.
Christoph Brause, Ingo Schiermeyer
2016 J jnl
On the chromatic number of (P
Electron. Notes Discret. Math.
Christoph Brause, Trung Duy Doan, Ingo Schiermeyer
2016 J jnl
On the minimum degree and the proper connection number of graphs.
Electron. Notes Discret. Math.
Christoph Brause, Trung Duy Doan, Ingo Schiermeyer
2016 J jnl
Proper connection number 2, connectivity, and forbidden subgraphs.
Electron. Notes Discret. Math.
Christoph Brause, Trung Duy Doan, Ingo Schiermeyer
2015 J jnl
4-colorability of P
Electron. Notes Discret. Math.
Christoph Brause, Ingo Schiermeyer, Premysl Holub, Zdenek Ryjácek, Petr Vrána, Rastislav Krivos-Bellus
2015 J jnl
Extending the Max Algorithm for maximum independent set.
Discuss. Math. Graph Theory
Christoph Brause, Ngoc Chi Lê, Ingo Schiermeyer
2015 J jnl
New sufficient conditions for α-redundant vertices.
Discret. Math.
Ngoc Chi Lê, Christoph Brause, Ingo Schiermeyer
2015 J jnl
The Maximum Independent Set Problem in Subclasses of S
Electron. Notes Discret. Math.
Ngoc Chi Lê, Christoph Brause, Ingo Schiermeyer
2015 J jnl
The Maximum Independent Set Problem in Subclasses of Subcubic Graphs.
Discret. Math.
Christoph Brause, Ngoc Chi Lê, Ingo Schiermeyer