The following pages link to Matthias Kriesell (Q345071):
Displaying 50 items.
- Antistrong digraphs (Q345072) (← links)
- Axioms for infinite matroids (Q390757) (← links)
- Vertex-disjoint directed and undirected cycles in general digraphs (Q402588) (← links)
- Packing Steiner trees on four terminals (Q602710) (← links)
- What is on his mind? (Q709300) (← links)
- On Seymour's strengthening of Hadwiger's conjecture for graphs with certain forbidden subgraphs (Q709320) (← links)
- Mader's conjecture on extremely critical graphs (Q858117) (← links)
- Contractions, cycle double covers, and cyclic colorings in locally connected graphs (Q859615) (← links)
- How to contract an essentially 6-connected graph to a 5-connected graph (Q864138) (← links)
- A constructive characterization of 3-connected triangle-free graphs (Q875938) (← links)
- There exist highly critically connected graphs of diameter three (Q882783) (← links)
- Disjoint directed and undirected paths and cycles in digraphs (Q1034635) (← links)
- On \(k\)-critical connected line graphs (Q1127873) (← links)
- A survey on contractible edges in graphs of a prescribed vertex connectivity (Q1348654) (← links)
- Upper bounds to the number of vertices in a \(k\)-critically \(n\)-connected graph (Q1348657) (← links)
- Edge-disjoint trees containing some given vertices in a graph (Q1405100) (← links)
- On decomposing a hypergraph into \(k\) connected sub-hypergraphs (Q1410689) (← links)
- Contractible non-edges in \(3\)-connected graphs (Q1569036) (← links)
- The \(k\)-critical \(2k\)-connected graphs for \(k\in\{3,4\}\) (Q1569066) (← links)
- Degree sequences and edge connectivity (Q1688269) (← links)
- Rooted complete minors in line graphs with a Kempe coloring (Q1741595) (← links)
- Contractible subgraphs in 3-connected graphs (Q1850482) (← links)
- A degree sum condition for the existence of a contractible edge in a \(\kappa\)-connected graph (Q1850535) (← links)
- All 4-connected line graphs of claw free graphs are Hamiltonian connected (Q1850549) (← links)
- Almost all 3-connected graphs contain a contractible set of \(k\) vertices (Q1850571) (← links)
- A contribution to a conjecture of A. Saito (Q1865142) (← links)
- Contractible non-edges in triangle-free graphs (Q1961761) (← links)
- Maximal ambiguously \(k\)-colorable graphs (Q2284731) (← links)
- Closed separator sets (Q2368589) (← links)
- In memoriam: Horst Sachs (1927--2016) (Q2401795) (← links)
- On the problem of finding disjoint cycles and dicycles in a digraph (Q2428634) (← links)
- On small contractible subgraphs in 3-connected graphs of small average degree (Q2464049) (← links)
- On the number of contractible triples in 3-connected graphs (Q2464158) (← links)
- On the pancyclicity of lexicographic products (Q2494117) (← links)
- Global connectivity and expansion: long cycles and factors in \(f\)-connected graphs (Q2495692) (← links)
- On the number of 4-contractible edges in 4-connected graphs (Q2519017) (← links)
- Disjoint \(A\)-paths in digraphs (Q2565693) (← links)
- The symmetric (2k, k)-graphs (Q2708794) (← links)
- Induced paths in 5-connected graphs (Q2708795) (← links)
- (Q2741346) (← links)
- (Q2741349) (← links)
- On factors of 4-connected claw-free graphs (Q2744573) (← links)
- Arc-Disjoint Directed and Undirected Cycles in Digraphs (Q2833257) (← links)
- Disjoint sub(di)graphs in digraphs (Q2851460) (← links)
- Balancing two spanning trees (Q3087621) (← links)
- On graphs double-critical with respect to the colouring number (Q3455028) (← links)
- Vertex suppression in 3-connected graphs (Q3539929) (← links)
- Edge disjoint Steiner trees in graphs without large bridges (Q3652550) (← links)
- (Q3843247) (← links)
- (Q4365823) (← links)
