The following pages link to Christoph Brause (Q279213):
Displaying 34 items.
- Kernelization of the 3-path vertex cover problem (Q279214) (← links)
- A lower bound on the independence number of a graph in terms of degrees and local clique sizes (Q298956) (← links)
- 4-colorability of \(P_6\)-free graphs (Q322185) (← links)
- The maximum independent set problem in subclasses of \(S_{i, j, k}\)-free graphs (Q322186) (← links)
- Local connectivity, local degree conditions, some forbidden induced subgraphs, and cycle extendability (Q507477) (← links)
- Proper connection number 2, connectivity, and forbidden subgraphs (Q510953) (← links)
- On the minimum degree and the proper connection number of graphs (Q510954) (← links)
- On the chromatic number of \((P_{5},K_{2,t})\)-free graphs (Q510963) (← links)
- On sequential heuristic methods for the maximum independent set problem (Q521760) (← links)
- On the chromatic number of \(2 K_2\)-free graphs (Q1634757) (← links)
- On upper bounds for the independent transversal domination number (Q1693131) (← links)
- Odd connection and odd vertex-connection of graphs (Q1800421) (← links)
- On forbidden induced subgraphs for \(K_{1, 3}\)-free perfect graphs (Q1999727) (← links)
- Independent domination in bipartite cubic graphs (Q2000581) (← links)
- On a relation between \(k\)-path partition and \(k\)-path vertex cover (Q2030433) (← links)
- From colourful to rainbow paths in graphs: colouring the vertices (Q2051888) (← links)
- Forbidden induced subgraphs for perfectness of claw-free graphs of independence number at least 4 (Q2124634) (← links)
- Homogeneous sets, clique-separators, critical graphs, and optimal \(\chi\)-binding functions (Q2166229) (← links)
- Partitioning \(H\)-free graphs of bounded diameter (Q2166756) (← links)
- Extending the MAX algorithm for maximum independent set (Q2344024) (← links)
- New sufficient conditions for \(\alpha\)-redundant vertices (Q2346329) (← links)
- The maximum independent set problem in subclasses of subcubic graphs (Q2346341) (← links)
- Sum choice number of generalized \(\theta\)-graphs (Q2401797) (← links)
- Proper connection and size of graphs (Q2401802) (← links)
- A subexponential-time algorithm for the maximum independent set problem in \(P_t\)-free graphs (Q2403797) (← links)
- Minimum degree conditions for the proper connection number of graphs (Q2409521) (← links)
- Bounds and extremal graphs for degenerate subsets, dynamic monopolies, and partial incentives (Q2421880) (← links)
- A characterization of trees with equal 2-domination and 2-independence numbers (Q4557835) (← links)
- Acyclic, star, and injective colouring: bounding the diameter (Q5918693) (← links)
- Acyclic, star, and injective colouring: bounding the diameter (Q5925554) (← links)
- (Q6147518) (← links)
- Loose edge-connection of graphs (Q6166663) (← links)
- Compatible spanning circuits and forbidden induced subgraphs (Q6184989) (← links)
- The proper 2-connection number of several graph classes (Q6633520) (← links)
