default search action
Christoph Brause
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [j32]Christoph Brause, Trung Duy Doan, Ingo Schiermeyer:
The proper 2-connection number of several graph classes. Discret. Appl. Math. 359: 34-44 (2024) - [j31]Zhiwei Guo, Christoph Brause, Maximilian Geißer, Ingo Schiermeyer
:
Compatible Spanning Circuits and Forbidden Induced Subgraphs. Graphs Comb. 40(1): 15 (2024) - 2023
- [j30]Christoph Brause, Stanislav Jendrol'
Loose Edge-Connection of Graphs. Graphs Comb. 39(4): 79 (2023) - 2022
- [j29]Christoph Brause, Petr A. Golovach, Barnaby Martin, Pascal Ochem, Daniël Paulusma
Acyclic, Star, and Injective Colouring: Bounding the Diameter. Electron. J. Comb. 29(2) (2022) - [j28]Christoph Brause, Maximilian Geißer, Ingo Schiermeyer
Homogeneous sets, clique-separators, critical graphs, and optimal χ-binding functions. Discret. Appl. Math. 320: 211-222 (2022) - [j27]Christoph Brause, Trung Duy Doan
Forbidden induced subgraphs for perfectness of claw-free graphs of independence number at least 4. Discret. Math. 345(6): 112837 (2022) - [j26]Christoph Brause, Petr A. Golovach
Partitioning H-free graphs of bounded diameter. Theor. Comput. Sci. 930: 37-52 (2022) - [i3]Christoph Brause, Jochen Harant, Florian Hörsch, Samuel Mohr:
Spanning trees of smallest maximum degree in subdivisions of graphs. CoRR abs/2210.04669 (2022) - 2021
- [j25]Christoph Brause, Stanislav Jendrol'
From Colourful to Rainbow Paths in Graphs: Colouring the Vertices. Graphs Comb. 37(5): 1823-1839 (2021) - [c2]Christoph Brause, Petr A. Golovach, Barnaby Martin, Daniël Paulusma
Partitioning H-Free Graphs of Bounded Diameter. ISAAC 2021: 21:1-21:14 - [c1]Christoph Brause, Petr A. Golovach
Acyclic, Star, and Injective Colouring: Bounding the Diameter. WG 2021: 336-348 - [i2]Christoph Brause, Petr A. Golovach, Barnaby Martin, Daniël Paulusma
Acyclic, Star, and Injective Colouring: Bounding the Diameter. CoRR abs/2104.10593 (2021) - [i1]Christoph Brause, Petr A. Golovach, Barnaby Martin, Daniël Paulusma
Partitioning H-Free Graphs of Bounded Diameter. CoRR abs/2105.04588 (2021)
2010 – 2019
- 2019
- [j24]Christoph Brause, Bert Randerath, Ingo Schiermeyer, Elkin Vumar:
On the chromatic number of 2K2-free graphs. Discret. Appl. Math. 253: 14-24 (2019) - [j23]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) - [j22]Christoph Brause, Stefan Ehard, Dieter Rautenbach:
Bounds and extremal graphs for degenerate subsets, dynamic monopolies, and partial incentives. Discret. Math. 342(7): 2127-2133 (2019) - [j21]Christoph Brause, Michael A. Henning:
Independent Domination in Bipartite Cubic Graphs. Graphs Comb. 35(4): 881-912 (2019) - 2018
- [j20]Christoph Brause, Michael A. Henning, Kenta Ozeki
On upper bounds for the independent transversal domination number. Discret. Appl. Math. 236: 66-72 (2018) - [j19]Christoph Brause, Stanislav Jendrol'
Odd connection and odd vertex-connection of graphs. Discret. Math. 341(12): 3500-3512 (2018) - 2017
- [j18]Christoph Brause, Rastislav Krivos-Bellus:
On a relation between k-path partition and k-path vertex cover. Discret. Appl. Math. 223: 28-38 (2017) - [j17]Christoph Brause:
A subexponential-time algorithm for the Maximum Independent Set Problem in Pt-free graphs. Discret. Appl. Math. 231: 113-118 (2017) - [j16]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) - [j15]Christoph Brause, Arnfried Kemnitz, Massimiliano Marangio, Anja Pruchnewski, Margit Voigt:
Sum choice number of generalized θ-graphs. Discret. Math. 340(11): 2633-2640 (2017) - [j14]Susan A. van Aardt, Christoph Brause, Alewyn P. Burger, Marietjie Frick
Proper connection and size of graphs. Discret. Math. 340(11): 2673-2677 (2017) - [j13]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) - [j12]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) - [j11]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
- [j10]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) - [j9]Christoph Brause, Ingo Schiermeyer:
Kernelization of the 3-path vertex cover problem. Discret. Math. 339(7): 1935-1939 (2016) - [j8]Christoph Brause, Trung Duy Doan, Ingo Schiermeyer:
Proper connection number 2, connectivity, and forbidden subgraphs. Electron. Notes Discret. Math. 55: 105-108 (2016) - [j7]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) - [j6]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) - 2015
- [j5]Ngoc Chi Lê
New sufficient conditions for α-redundant vertices. Discret. Math. 338(10): 1674-1680 (2015) - [j4]Christoph Brause, Ngoc Chi Lê, Ingo Schiermeyer:
The Maximum Independent Set Problem in Subclasses of Subcubic Graphs. Discret. Math. 338(10): 1766-1778 (2015) - [j3]Christoph Brause, Ngoc Chi Lê, Ingo Schiermeyer:
Extending the Max Algorithm for maximum independent set. Discuss. Math. Graph Theory 35(2): 365-386 (2015) - [j2]Christoph Brause, Ingo Schiermeyer, Premysl Holub, Zdenek Ryjácek, Petr Vrána
4-colorability of P6-free graphs. Electron. Notes Discret. Math. 49: 37-42 (2015) - [j1]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)
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 2024-09-02 00:11 CEST 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: