The following pages link to Timothy R. S. Walsh (Q442385):
Displaying 50 items.
- (Q391386) (redirect page) (← links)
- Counting maps on doughnuts (Q391387) (← links)
- Enumeration of unrooted orientable maps of arbitrary genus by number of edges and vertices (Q442387) (← links)
- (Q587603) (redirect page) (← links)
- On dynamic shortest paths problems (Q639278) (← links)
- On the symmetry and asymmetry of combinatorial structures (Q688675) (← links)
- Classification of the genus-1 rooted maps and associated functional relation (Q688679) (← links)
- The tennis ball problem (Q696915) (← links)
- Counting permutations by their rigid patterns (Q696917) (← links)
- On the complexity of topological sorting (Q750150) (← links)
- (Q787999) (redirect page) (← links)
- Colorings of hypermaps and a conjecture of Brenner and Lyndon (Q788000) (← links)
- On the sphericity and cubicity of graphs (Q789416) (← links)
- On the number of rooted c-nets (Q793049) (← links)
- How evenly should one divide to conquer quickly? (Q800084) (← links)
- Inversion of cycle index sum relations for 2- and 3-connected graphs (Q804584) (← links)
- Counting unrooted maps on the plane (Q859622) (← links)
- Chromatic sums of general maps on the sphere and the projective plane (Q861795) (← links)
- Bisingular maps on the torus (Q874353) (← links)
- On two dual classes of planar graphs (Q916681) (← links)
- Region distributions of graph embeddings and Stirling numbers (Q919004) (← links)
- Weighted enumeration of spanning subgraphs with degree constraints (Q1003837) (← links)
- (Q1065556) (redirect page) (← links)
- On the size of quadtrees generalized to d-dimensional binary pictures (Q1065557) (← links)
- A new enumerative property of the Narayana numbers (Q1080851) (← links)
- A probabilistic method for lattice path enumeration (Q1081604) (← links)
- Les hypercartes planaires sont des arbres très bien étiquetés. (Planar hypermaps are well-labeled trees) (Q1081609) (← links)
- Finding the two-core of a tree (Q1086244) (← links)
- Relations fonctionnelles et dénombrement des cartes pointées sur le tore. (Functional relations and the enumeration of rooted genus one maps) (Q1092921) (← links)
- Réseaux et polynômes de dénombrement. (Networks and enumeration polynomials) (Q1094431) (← links)
- Matching is as easy as matrix inversion (Q1095658) (← links)
- Counting non-isomorphic three-connected planar maps (Q1144046) (← links)
- Counting labelled three-connected and homeomorphically irreducible two- connected graphs (Q1147157) (← links)
- Counting unlabelled three-connected and homeomorphically irreducible two- connected graphs (Q1147158) (← links)
- The towers of Hanoi revisited: Moving the rings by counting the moves (Q1165783) (← links)
- Optimal covering of cacti by vertex-disjoint paths (Q1178689) (← links)
- Hypermap rewriting: A combinatorial approach (Q1178702) (← links)
- Coloring nearly-disjoint hypergraphs with \(n + o(n)\) colors (Q1185879) (← links)
- A note on bounding \(k\)-terminal reliability (Q1186804) (← links)
- A solution to a colouring problem of P. Erdős (Q1197012) (← links)
- Precoloring extension. I: Interval graphs (Q1198648) (← links)
- On enumeration of spanning subgraphs with a preassigned cyclomatic number in a graph (Q1207353) (← links)
- On graphs having \(\sigma\)-polynomials of the same degree (Q1208359) (← links)
- Coloring drawings of bipartite graphs: A problem in automated assembly (Q1208463) (← links)
- Counting rooted maps by genus. III: Nonseparable maps (Q1214945) (← links)
- Hypermaps versus bipartite maps (Q1215509) (← links)
- Approximating matchings in parallel (Q1261482) (← links)
- Efficient parallel algorithms for r-dominating set and p-center problems on trees (Q1262780) (← links)
- Efficient parallel algorithms for graph problems (Q1262781) (← links)
- Enumerative questions on rooted weighted necklaces (Q1271869) (← links)
