The following pages link to Infinite graphs—A survey (Q5534021):
Displayed 25 items.
- Matroid intersection, base packing and base covering for infinite matroids (Q276439) (← links)
- Menger's theorem for graphs containing no infinite paths (Q594106) (← links)
- Survey article: consequences of some outerplanarity extensions (Q691264) (← links)
- The Erdős-Menger conjecture for source/sink sets with disjoint closures (Q707026) (← links)
- What is on his mind? (Q709300) (← links)
- On a packing problem for infinite graphs and independence spaces (Q754225) (← links)
- Reduction graphs in the lambda calculus (Q792994) (← links)
- Menger's theorem for infinite graphs (Q1016232) (← links)
- The spectrum of an infinite graph (Q1172649) (← links)
- Sets of matrices all infinite products of which converge (Q1183158) (← links)
- Rado's Selection Principle: Applications to binary relations, graph and hypergraph colorings and partially ordered sets (Q1195481) (← links)
- Chromatic numbers of infinite graphs (Q1212469) (← links)
- On the existence of k-separated finite and infinite dipaths (Q1235181) (← links)
- Infinite triangulated graphs (Q1247986) (← links)
- On the metric dimension of infinite graphs (Q1759836) (← links)
- The rigidity of infinite graphs (Q1991339) (← links)
- Flexing infinite frameworks with applications to braced Penrose tilings (Q2097158) (← links)
- Refined finiteness and degree properties in graphs (Q2113832) (← links)
- Arboricity and tree-packing in locally finite graphs (Q2490258) (← links)
- Hamiltonian lines in infinite graphs with few vertices of smll valency (Q2552140) (← links)
- Understanding chicken walks on <i>n</i> × <i>n</i> grid: Hamiltonian paths, discrete dynamics, and rectifiable paths (Q3467125) (← links)
- (Q5009706) (← links)
- Infinite graphs with finite dominating sets (Q5370828) (← links)
- Orientations of infinite graphs with prescribed edge-connectivity (Q5915870) (← links)
- On topological obstructions to the existence of non-periodic Wannier bases (Q6203741) (← links)