The following pages link to Timothy R. S. Walsh (Q442385):
Displaying 50 items.
- Combinatorial statistics on alternating permutations (Q1272898) (← links)
- The graph polynomial and the number of proper vertex colorings (Q1296159) (← links)
- Every circle graph of girth at least 5 is 3-colourable (Q1296984) (← links)
- On the mean chromatic number (Q1322240) (← links)
- Recent developments in total colouring (Q1322273) (← links)
- Perfect graphs with no \(P_ 5\) and no \(K_ 5\) (Q1334944) (← links)
- Riordan arrays and combinatorial sums (Q1336667) (← links)
- The smallest hard-to-color graph for the SL algorithm (Q1356706) (← links)
- Enumeration of unlabelled bicolored graphs by degree parities (Q1361672) (← links)
- Chromaticity of a family of \(K_ 4\) homeomorphs (Q1366777) (← links)
- Chromatic equivalence classes of certain generalized polygon trees (Q1366783) (← links)
- Maximum chromatic polynomial of 3-chromatic blocks (Q1366786) (← links)
- A bijective proof of an enumerative property of legal bracketings (Q1377698) (← links)
- A bijection on Dyck paths and its consequences (Q1377728) (← links)
- An algorithm for coloring some perfect graphs (Q1382811) (← links)
- Nombre de factorisations d'un grand cycle (Number of factorizations of a large cycle) (Q1423021) (← links)
- On the number of fair triangulations (Q1569955) (← links)
- The enumeration of self-complementary \(k\)-multigraphs (Q1582580) (← links)
- Rotary hypermaps of genus 2 (Q1591745) (← links)
- Group colorability of multigraphs (Q1759814) (← links)
- Counting unrooted loopless planar maps (Q1775030) (← links)
- Efficient enumeration of sensed planar maps (Q1779505) (← links)
- On \(\sigma\)-polynomials and a class of chromatically unique graphs (Q1801695) (← links)
- Generalizations of independence and chromatic numbers of a graph (Q1801703) (← links)
- A characterization of graphs with interval two-step graphs (Q1805321) (← links)
- List edge-colorings of series-parallel graphs (Q1808155) (← links)
- Sur un nouvel invariant des graphes et un critère de planarité. (On a new graph invariant and a planarity criterion) (Q1813331) (← links)
- Enumeration of labeled, connected, homeomorphically irreducible graphs (Q1814542) (← links)
- A proof of a conjecture for the number of ramified coverings of the sphere by the torus (Q1818213) (← links)
- A simple linear expected time algorithm for finding a Hamilton path (Q1823260) (← links)
- Enumeration of Eulerian and unicursal planar maps (Q1827745) (← links)
- Iteration strikes back - at the cyclic Towers of Hanoi (Q1838033) (← links)
- Enumeration of loopless maps on the projective plane (Q1847596) (← links)
- Singular maps on the Klein bottle (Q1847636) (← links)
- Generalization of two results of Hilton on total-colourings of a graph (Q1893175) (← links)
- The number of \(m\)-Husimi trees fixed by a permutation of the vertices (Q1893980) (← links)
- Riordan arrays and the Abel-Gould identity (Q1896358) (← links)
- Homomorphism and sigma polynomials (Q1902912) (← links)
- No-hole \(k\)-tuple \((r+1)\)-distant colorings of odd cycles (Q1917241) (← links)
- A reductive technique for enumerating non-isomorphic planar maps (Q1923513) (← links)
- Greedy algorithms for triangle free coloring (Q1927697) (← links)
- A note on generalized chromatic number and generalized girth (Q1970697) (← links)
- A refinement of Vizing's theorem (Q1978167) (← links)
- Minimal \(k\)-extensions of precomplete graphs (Q2386968) (← links)
- Corrigendum to: ``Enumeration of Eulerian and unicursal planar maps'' (Q2421886) (← links)
- Classification of reflexible regular embeddings and self-Petrie dual regular embeddings of complete bipartite graphs (Q2483396) (← links)
- Counting rooted maps by genus. I (Q2549700) (← links)
- Counting rooted maps by genus. II (Q2549701) (← links)
- Characterizing the vertex neighbourhoods of semi-regular polyhedra (Q2554177) (← links)
- Counting rooted maps by genus. II. Erratum (Q2560418) (← links)
