Christoph Brause

According to our database, Christoph Brause authored at least 34 papers between 2015 and 2024.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2024

Compatible Spanning Circuits and Forbidden Induced Subgraphs.

Zhiwei Guo, Christoph Brause, Maximilian Geißer, Ingo Schiermeyer

Graphs Comb., February, 2024

2023

Loose Edge-Connection of Graphs.

Christoph Brause, Stanislav Jendrol', Ingo Schiermeyer

Graphs Comb., August, 2023

2022

Partitioning <i>H</i>-free graphs of bounded diameter.

Christoph Brause, Petr A. Golovach, Barnaby Martin, Daniël Paulusma, Siani Smith

Theor. Comput. Sci., 2022

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

Christoph Brause, Trung Duy Doan, Premysl Holub, Adam Kabela, Zdenek Ryjácek, Ingo Schiermeyer, Petr Vrána

Discret. Math., 2022

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

Christoph Brause, Maximilian Geißer, Ingo Schiermeyer

Discret. Appl. Math., 2022

Spanning trees of smallest maximum degree in subdivisions of graphs.

Christoph Brause, Jochen Harant, Florian Hörsch, Samuel Mohr

CoRR, 2022

Acyclic, Star, and Injective Colouring: Bounding the Diameter.

Christoph Brause, Petr A. Golovach, Barnaby Martin, Pascal Ochem, Daniël Paulusma, Siani Smith

Electron. J. Comb., 2022

2021

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

Christoph Brause, Stanislav Jendrol', Ingo Schiermeyer

Graphs Comb., 2021

Acyclic, Star, and Injective Colouring: Bounding the Diameter.

Christoph Brause, Petr A. Golovach, Barnaby Martin, Daniël Paulusma, Siani Smith

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

Partitioning H-Free Graphs of Bounded Diameter.

Christoph Brause, Petr A. Golovach, Barnaby Martin, Daniël Paulusma, Siani Smith

Proceedings of the 32nd International Symposium on Algorithms and Computation, 2021

2019

Independent Domination in Bipartite Cubic Graphs.

Christoph Brause, Michael A. Henning

Graphs Comb., 2019

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

Christoph Brause, Premysl Holub, Adam Kabela, Zdenek Ryjácek, Ingo Schiermeyer, Petr Vrána

Discret. Math., 2019

Bounds and extremal graphs for degenerate subsets, dynamic monopolies, and partial incentives.

Christoph Brause, Stefan Ehard, Dieter Rautenbach

Discret. Math., 2019

On the chromatic number of 2K2-free graphs.

Christoph Brause, Bert Randerath, Ingo Schiermeyer, Elkin Vumar

Discret. Appl. Math., 2019

2018

Odd connection and odd vertex-connection of graphs.

Christoph Brause, Stanislav Jendrol', Ingo Schiermeyer

Discret. Math., 2018

On upper bounds for the independent transversal domination number.

Christoph Brause, Michael A. Henning, Kenta Ozeki, Ingo Schiermeyer, Elkin Vumar

Discret. Appl. Math., 2018

2017

Minimum Degree Conditions for the Proper Connection Number of Graphs.

Christoph Brause, Trung Duy Doan, Ingo Schiermeyer

Graphs Comb., 2017

A characterization of trees with equal 2-domination and 2-independence numbers.

Christoph Brause, Michael A. Henning, Marcin Krzywkowski

Discret. Math. Theor. Comput. Sci., 2017

On sequential heurestic methods for the maximum independent set problem.

Christoph Brause, Ngoc Chi Lê, Ingo Schiermeyer

Discuss. Math. Graph Theory, 2017

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

Christoph Brause, Dieter Rautenbach, Ingo Schiermeyer

Discret. Math., 2017

Sum choice number of generalized θ-graphs.

Christoph Brause, Arnfried Kemnitz, Massimiliano Marangio, Anja Pruchnewski, Margit Voigt

Discret. Math., 2017

Proper connection and size of graphs.

Susan A. van Aardt, Christoph Brause, Alewyn P. Burger, Marietjie Frick, Arnfried Kemnitz, Ingo Schiermeyer

Discret. Math., 2017

On a relation between k-path partition and k-path vertex cover.

Christoph Brause, Rastislav Krivos-Bellus

Discret. Appl. Math., 2017

A subexponential-time algorithm for the Maximum Independent Set Problem in Pt-free graphs.

Christoph Brause

Discret. Appl. Math., 2017

2016

On the chromatic number of (P₅, K_{2, t})-free graphs.

Christoph Brause, Trung Duy Doan, Ingo Schiermeyer

Electron. Notes Discret. Math., 2016

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

Christoph Brause, Trung Duy Doan, Ingo Schiermeyer

Electron. Notes Discret. Math., 2016

Proper connection number 2, connectivity, and forbidden subgraphs.

Christoph Brause, Trung Duy Doan, Ingo Schiermeyer

Electron. Notes Discret. Math., 2016

Kernelization of the 3-path vertex cover problem.

Christoph Brause, Ingo Schiermeyer

Discret. Math., 2016

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

Christoph Brause, Bert Randerath, Dieter Rautenbach, Ingo Schiermeyer

Discret. Appl. Math., 2016

2015

The Maximum Independent Set Problem in Subclasses of S_{i, j, k}-Free Graphs.

Ngoc Chi Lê, Christoph Brause, Ingo Schiermeyer

Electron. Notes Discret. Math., 2015

4-colorability of P₆-free graphs.

Christoph Brause, Ingo Schiermeyer, Premysl Holub, Zdenek Ryjácek, Petr Vrána, Rastislav Krivos-Bellus

Electron. Notes Discret. Math., 2015

Extending the Max Algorithm for maximum independent set.

Christoph Brause, Ngoc Chi Lê, Ingo Schiermeyer

Discuss. Math. Graph Theory, 2015

New sufficient conditions for α-redundant vertices.

Ngoc Chi Lê, Christoph Brause, Ingo Schiermeyer

Discret. Math., 2015

The Maximum Independent Set Problem in Subclasses of Subcubic Graphs.

Christoph Brause, Ngoc Chi Lê, Ingo Schiermeyer

Discret. Math., 2015