Christoph Brause

According to our database1, Christoph Brause authored at least 24 papers between 2015 and 2019.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

On csauthors.net:

Bibliography

2019
Independent Domination in Bipartite Cubic Graphs.
Graphs Comb., 2019

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

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

On the chromatic number of 2K2-free graphs.
Discret. Appl. Math., 2019

2018
Odd connection and odd vertex-connection of graphs.
Discret. Math., 2018

On upper bounds for the independent transversal domination number.
Discret. Appl. Math., 2018

2017
Minimum Degree Conditions for the Proper Connection Number of Graphs.
Graphs Comb., 2017

A characterization of trees with equal 2-domination and 2-independence numbers.
Discret. Math. Theor. Comput. Sci., 2017

On sequential heurestic methods for the maximum independent set problem.
Discuss. Math. Graph Theory, 2017

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

Sum choice number of generalized θ-graphs.
Discret. Math., 2017

Proper connection and size of graphs.
Discret. Math., 2017

On a relation between k-path partition and k-path vertex cover.
Discret. Appl. Math., 2017

A subexponential-time algorithm for the Maximum Independent Set Problem in Pt-free graphs.
Discret. Appl. Math., 2017

2016
On the chromatic number of (P<sub>5</sub>, K<sub>2, t</sub>)-free graphs.
Electron. Notes Discret. Math., 2016

On the minimum degree and the proper connection number of graphs.
Electron. Notes Discret. Math., 2016

Proper connection number 2, connectivity, and forbidden subgraphs.
Electron. Notes Discret. Math., 2016

Kernelization of the 3-path vertex cover problem.
Discret. Math., 2016

A lower bound on the independence number of a graph in terms of degrees and local clique sizes.
Discret. Appl. Math., 2016

2015
The Maximum Independent Set Problem in Subclasses of S<sub>i, j, k</sub>-Free Graphs.
Electron. Notes Discret. Math., 2015

4-colorability of P<sub>6</sub>-free graphs.
Electron. Notes Discret. Math., 2015

Extending the Max Algorithm for maximum independent set.
Discuss. Math. Graph Theory, 2015

New sufficient conditions for α-redundant vertices.
Discret. Math., 2015

The Maximum Independent Set Problem in Subclasses of Subcubic Graphs.
Discret. Math., 2015


  Loading...