The following pages link to (Q3491608):
Displayed 21 items.
- Decomposing locally semicomplete digraphs into strong spanning subdigraphs (Q414643) (← links)
- Logical aspects of Cayley-graphs: the group case (Q705541) (← links)
- What is on his mind? (Q709300) (← links)
- Linked tree-decompositions of represented infinite matroids (Q716055) (← links)
- \(k\)-strong spanning local tournaments in locally semicomplete digraphs (Q967291) (← links)
- Spanning 2-strong tournaments in 3-strong semicomplete digraphs (Q968409) (← links)
- Problems and conjectures concerning connectivity, paths, trees and cycles in tournament-like digraphs (Q1045053) (← links)
- Edge-disjoint in- and out-branchings in tournaments and related path problems (Q1112061) (← links)
- The Menger-like property of the three-width of infinite graphs (Q1121910) (← links)
- Excluding infinite minors (Q1191928) (← links)
- A note on spanning local tournaments in locally semicomplete digraphs (Q1281404) (← links)
- Excluding a countable clique (Q1305523) (← links)
- Chords of longest cycles in cubic graphs (Q1386433) (← links)
- Clique-width of countable graphs: A compactness property. (Q1422417) (← links)
- Making a tournament \(k\)-arc-strong by reversing or deorienting arcs. (Q1427175) (← links)
- On orienting graphs for connectivity: Projective planes and Halin graphs (Q1758272) (← links)
- On the existence of \(k\) edge-disjoint 2-connected spanning subgraphs (Q2573645) (← links)
- Disjoint sub(di)graphs in digraphs (Q2851460) (← links)
- Subgraphs of large connectivity and chromatic number in graphs of large chromatic number (Q3791167) (← links)
- Infinite, highly connected digraphs with no two arc-disjoint spanning trees (Q3816091) (← links)
- Small degree out‐branchings (Q4805223) (← links)