The following pages link to Marc Noy (Q170490):
Displaying 50 items.
- Maximum degree in minor-closed classes of graphs (Q268260) (← links)
- (Q360350) (redirect page) (← links)
- On the evaluation of the Tutte polynomial at the points \((1, -1)\) and \((2, -1)\) (Q360351) (← links)
- Random cubic planar graphs revisited (Q510583) (← links)
- Counting outerplanar maps (Q528975) (← links)
- Degree distribution in random planar graphs (Q549258) (← links)
- Augmenting the connectivity of outerplanar graphs (Q848960) (← links)
- Hamiltonicity and colorings of arrangement graphs (Q860408) (← links)
- Counting polygon dissections in the projective plane (Q953906) (← links)
- Growth constants of minor-closed classes of graphs (Q974473) (← links)
- Identities for non-crossing graphs and multigraphs (Q998488) (← links)
- The number of graphs not containing \(K_{3,3}\) as a minor (Q1010848) (← links)
- Gray codes for non-crossing partitions and dissections of a convex polygon (Q1028124) (← links)
- Partitions of a finite Boolean lattice into intervals (Q1041598) (← links)
- Triangulations, visibility graph and reflex vertices of a simple polygon (Q1126249) (← links)
- Stabbing information of a simple polygon (Q1283786) (← links)
- Geometric tree graphs of points in convex position (Q1289020) (← links)
- Properties of random triangulations and trees (Q1293354) (← links)
- Bipartite embeddings of trees in the plane (Q1296568) (← links)
- Analytic combinatorics of non-crossing configurations (Q1300975) (← links)
- Stage-graph representations (Q1363763) (← links)
- Enumeration of noncrossing trees on a circle (Q1381832) (← links)
- Consecutive patterns in permutations (Q1398289) (← links)
- Lattice path matroids: Enumerative aspects and Tutte polynomials (Q1417949) (← links)
- Recursively constructible families of graphs (Q1433010) (← links)
- A class of point-sets with few \(k\)-sets (Q1577490) (← links)
- Planar segment visibility graphs (Q1581056) (← links)
- On the chromatic number of tree graphs (Q1587620) (← links)
- Lower bounds on the number of crossing-free subgraphs of \(K_N\) (Q1594599) (← links)
- On the minimum size of visibility graphs (Q1603508) (← links)
- Statistics on non-crossing trees (Q1613530) (← links)
- Enumeration of labeled 4-regular planar graphs (Q1690037) (← links)
- Logical limit laws for minor-closed classes of graphs (Q1745738) (← links)
- Clusters, generating functions and asymptotics for consecutive patterns in permutations (Q1761477) (← links)
- On the number of bases of bicircular matroids (Q1773878) (← links)
- The first order convergence law fails for random perfect graphs (Q1792064) (← links)
- Flipping edges in triangulations (Q1807608) (← links)
- Locally grid graphs: Classification and Tutte uniqueness (Q1810656) (← links)
- Diagonally convex directed polyominoes and even trees: A bijection and related issues (Q1849976) (← links)
- Irreducibility of the Tutte polynomial of a connected matroid (Q1850570) (← links)
- Improved bounds for the number of forests and acyclic orientations in the square lattice (Q1856350) (← links)
- Graphs of non-crossing perfect matchings (Q1865140) (← links)
- A lower bound on the number of triangulations of planar point sets (Q1882855) (← links)
- Graphs determined by polynomial invariants (Q1885023) (← links)
- On graphs determined by their Tutte polynomials (Q1889848) (← links)
- Ears of triangulations and Catalan numbers (Q1910592) (← links)
- Graph of triangulations of a convex polygon and tree of triangulations (Q1961385) (← links)
- Random planar maps and graphs with minimum degree two and three (Q1991412) (← links)
- Cycles of given lengths in unicyclic components in sparse random graphs (Q2020020) (← links)
- On the expected number of perfect matchings in cubic planar graphs (Q2075311) (← links)
