The following pages link to (Q3216652):
Displayed 50 items.
- Sequential Monte Carlo for Sampling Balanced and Compact Redistricting Plans (Q58510) (← links)
- Canonical tree-decompositions of finite graphs. II. Essential parts (Q257005) (← links)
- Chromatic and flow polynomials of generalized vertex join graphs and outerplanar graphs (Q266794) (← links)
- Growth rates of groups associated with face 2-coloured triangulations and directed Eulerian digraphs on the sphere (Q278890) (← links)
- Distributive lattice structure on the set of perfect matchings of carbon nanotubes (Q298091) (← links)
- Graphs with maximal induced matchings of the same size (Q344824) (← links)
- On some putative graph-theoretic counterexamples to the principle of the identity of indiscernibles (Q383048) (← links)
- Formal specification and proofs for the topology and classification of combinatorial surfaces (Q396466) (← links)
- The number of Euler tours of random directed graphs (Q396813) (← links)
- The adjacency matroid of a graph (Q396844) (← links)
- Connectivity and tree structure in finite graphs (Q397061) (← links)
- Counting 2-connected 4-regular maps on the projective plane (Q405265) (← links)
- General approximation schemes for min-max (regret) versions of some (pseudo-)polynomial problems (Q429650) (← links)
- Near-central permutation factorization and Strahov's generalized Murnaghan-Nakayama rule (Q444916) (← links)
- Is the five-flow conjecture almost false? (Q463296) (← links)
- On triangulating \(k\)-outerplanar graphs (Q479051) (← links)
- Hyperbolicity cones of elementary symmetric polynomials are spectrahedral (Q479232) (← links)
- Triangulations of the sphere, bitrades and abelian groups (Q484547) (← links)
- The transition matroid of a 4-regular graph: an introduction (Q491757) (← links)
- Memory efficient algorithms for cactus graphs and block graphs (Q528335) (← links)
- Topological graph polynomial and quantum field theory. II: Mehler kernel theories (Q533626) (← links)
- Ghost symmetry and an analogue of Steinitz's theorem (Q536157) (← links)
- Topological graph polynomials in colored group field theory (Q625725) (← links)
- The cactus tree of a metric space (Q640324) (← links)
- Hamiltonian properties of locally connected graphs with bounded vertex degree (Q643015) (← links)
- Phased graphs and graph energies (Q645132) (← links)
- Extending Steinitz's theorem to upward star-shaped polyhedra and spherical polyhedra (Q652524) (← links)
- Genus expansion for real Wishart matrices (Q662881) (← links)
- Optimal parallel algorithms for path problems on planar graphs (Q673083) (← links)
- Strongly linear trend-free block designs and 1-factors of representative graphs (Q698023) (← links)
- Construction of Voronoi diagrams in the plane by using maps (Q751861) (← links)
- Paths and cycles concerning independence edges (Q757417) (← links)
- Merging in maps and in pavings (Q809631) (← links)
- The structure of the models of decidable monadic theories of graphs (Q810005) (← links)
- Partial duality for ribbon graphs. III: A gray code algorithm for enumeration (Q825536) (← links)
- I/O-efficient algorithms for graphs of bounded treewidth (Q834592) (← links)
- An intuitionistic proof of a discrete form of the Jordan curve theorem formalized in Coq with combinatorial hypermaps (Q839032) (← links)
- Conformal covariance of the Abelian sandpile height one field (Q841477) (← links)
- Isospectral flows that preserve matrix structure (Q864558) (← links)
- Isospectral flows preserving some centrosymmetric structures (Q875039) (← links)
- Bounds for the coefficients of flow polynomials (Q875944) (← links)
- A rooted map invariant, non-orientability and Jack symmetric functions (Q875947) (← links)
- Realizations of branched self-coverings of the 2-sphere (Q891243) (← links)
- Canonical tree-decompositions of finite graphs. I: Existence and algorithms. (Q895993) (← links)
- The construction and classification of self-dual spherical polyhedra (Q910715) (← links)
- The double reconstruction conjecture about finite colored hypergraphs (Q912131) (← links)
- Inapproximability of the Tutte polynomial (Q937302) (← links)
- The KP hierarchy, branched covers, and triangulations (Q947772) (← links)
- Connectivity in frame matroids (Q952661) (← links)
- Treewidth computations. I: Upper bounds (Q964001) (← links)