The following pages link to Maya Jakobine Stein (Q1010833):
Displaying 17 items.
- The approximate Loebl-Komlós-Sós conjecture and embedding trees in sparse graphs (Q256345) (← links)
- Partitioning 3-edge-coloured complete bipartite graphs into monochromatic cycles (Q324372) (← links)
- Connectivity and tree structure in finite graphs (Q397061) (← links)
- On claw-free \(t\)-perfect graphs (Q431021) (← links)
- Complexity of splits reconstruction for low-degree trees (Q476307) (← links)
- Clique coloring \(B_1\)-EPG graphs (Q512582) (← links)
- Convex \(p\)-partitions of bipartite graphs (Q897926) (← links)
- Almost partitioning 2-edge-colourings of 3-uniform hypergraphs with two monochromatic tight cycles (Q1689909) (← links)
- Partitioning 2-coloured complete \(k\)-uniform hypergraphs into monochromatic \(\ell\)-cycles (Q1750222) (← links)
- Three-coloring and list three-coloring of graphs without induced paths on seven vertices (Q1786047) (← links)
- Local colourings and monochromatic partitions in complete bipartite graphs (Q5890922) (← links)
- An approximate version of the Loebl-Komlós-Sós conjecture (Q5895546) (← links)
- Local colourings and monochromatic partitions in complete bipartite graphs (Q5965537) (← links)
- Antidirected subgraphs of oriented graphs (Q6507204) (← links)
- On the Ramsey number of the double star (Q6515900) (← links)
- An exact upper bound for the minimum size of a path system that weakly separates a clique (Q6525861) (← links)
- Monochromatic partitions in 2-edge-coloured bipartite graphs (Q6526672) (← links)
