Available identifiers
zbMath Open brause.christophMaRDI QIDQ279213
List of research outcomes
| Publication | Date of Publication | Type |
|---|
| Compatible spanning circuits and forbidden induced subgraphs | 2024-01-29 | Paper |
| https://portal.mardi4nfdi.de/entity/Q6147518 | 2024-01-15 | Paper |
| Loose edge-connection of graphs | 2023-08-03 | Paper |
| Spanning trees of smallest maximum degree in subdivisions of graphs | 2022-10-10 | Paper |
| Partitioning \(H\)-free graphs of bounded diameter | 2022-08-25 | Paper |
| Homogeneous sets, clique-separators, critical graphs, and optimal \(\chi\)-binding functions | 2022-08-24 | Paper |
| Acyclic, star, and injective colouring: bounding the diameter | 2022-06-13 | Paper |
| Acyclic, star, and injective colouring: bounding the diameter | 2022-06-08 | Paper |
| Forbidden induced subgraphs for perfectness of claw-free graphs of independence number at least 4 | 2022-04-11 | Paper |
| From colourful to rainbow paths in graphs: colouring the vertices | 2021-11-25 | Paper |
| On a relation between \(k\)-path partition and \(k\)-path vertex cover | 2021-06-07 | Paper |
| Partitioning H-Free Graphs of Bounded Diameter | 2021-05-10 | Paper |
| Acyclic, Star, and Injective Colouring: Bounding the Diameter | 2021-04-21 | Paper |
| Independent domination in bipartite cubic graphs | 2019-06-28 | Paper |
| On forbidden induced subgraphs for \(K_{1, 3}\)-free perfect graphs | 2019-06-27 | Paper |
| Bounds and extremal graphs for degenerate subsets, dynamic monopolies, and partial incentives | 2019-06-18 | Paper |
| On the chromatic number of \(2 K_2\)-free graphs | 2018-12-18 | Paper |
| A characterization of trees with equal 2-domination and 2-independence numbers | 2018-11-26 | Paper |
| Odd connection and odd vertex-connection of graphs | 2018-10-23 | Paper |
| On upper bounds for the independent transversal domination number | 2018-01-11 | Paper |
| Minimum degree conditions for the proper connection number of graphs | 2017-10-11 | Paper |
| A subexponential-time algorithm for the maximum independent set problem in \(P_t\)-free graphs | 2017-09-12 | Paper |
| Sum choice number of generalized \(\theta\)-graphs | 2017-09-05 | Paper |
| Proper connection and size of graphs | 2017-09-05 | Paper |
| On sequential heuristic methods for the maximum independent set problem | 2017-04-12 | Paper |
| Proper connection number 2, connectivity, and forbidden subgraphs | 2017-02-14 | Paper |
| On the minimum degree and the proper connection number of graphs | 2017-02-14 | Paper |
| On the chromatic number of \((P_{5},K_{2,t})\)-free graphs | 2017-02-14 | Paper |
| Local connectivity, local degree conditions, some forbidden induced subgraphs, and cycle extendability | 2017-02-06 | Paper |
| 4-colorability of \(P_6\)-free graphs | 2016-10-14 | Paper |
| The maximum independent set problem in subclasses of \(S_{i, j, k}\)-free graphs | 2016-10-14 | Paper |
| A lower bound on the independence number of a graph in terms of degrees and local clique sizes | 2016-06-21 | Paper |
| Kernelization of the 3-path vertex cover problem | 2016-04-27 | Paper |
| New sufficient conditions for \(\alpha\)-redundant vertices | 2015-06-01 | Paper |
| The maximum independent set problem in subclasses of subcubic graphs | 2015-06-01 | Paper |
| Extending the MAX algorithm for maximum independent set | 2015-05-11 | Paper |
Research outcomes over time
Doctoral students
No records found.
Known relations from the MaRDI Knowledge Graph
This page was built for person: Christoph Brause
