The following pages link to (Q3216652):
Displayed 50 items.
- 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)
- 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)
- 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)
- Annular embeddings of permutations for arbitrary genus (Q965211) (← links)
- Packing non-zero \(A\)-paths in an undirected model of group labeled graphs (Q965242) (← links)
- A note on certain de Bruijn sequences with forbidden subsequences (Q965982) (← links)
- A little statistical mechanics for the graph theorist (Q973134) (← links)
- Fusion graphs: merging properties and watersheds (Q1009213) (← links)
- Structure of Jackson integrals of \(BC_n\) type (Q1012444) (← links)
- Testing planarity of geometric automorphisms in linear time (Q1018045) (← links)
- Structure and enumeration of two-connected graphs with prescribed three-connected components (Q1023394) (← links)
- An algorithm for constructing star-shaped drawings of plane graphs (Q1037784) (← links)
- Flows, flow-pair covers and cycle double covers (Q1044934) (← links)
- Cubic combinatorial maps (Q1073039) (← links)
- A linear-processor algorithm for depth-first search in planar graphs (Q1110342) (← links)
- Generalized activities and the Tutte polynomial (Q1173634) (← links)
- The monadic second-order logic of graphs. V: On closing the gap between definability and recognizability (Q1176232) (← links)
- Elementary divisors of graphs and matroids (Q1178029) (← links)
- On some factor theorems of graphs (Q1185099) (← links)
- Generalized activities and \(K\)-terminal reliability (Q1186380) (← links)
- Unimodular equivalence of graphs (Q1194290) (← links)
- Detecting cycles through three fixed vertices in a graph (Q1198018) (← links)
- Reducible chains in several types of 2-connected graphs (Q1199497) (← links)
- Pre-Regge calculus: Topology via logic (Q1209252) (← links)
- Computing with graph rewriting systems with priorities (Q1261464) (← links)
- Asymmetric Abelian sandpile models (Q1279118) (← links)
- On the rooted Tutte polynomial (Q1296162) (← links)
- A combinatorial relationship between Eulerian maps and hypermaps in orientable surfaces (Q1296755) (← links)
- Minor-equivalence for infinite graphs (Q1296983) (← links)
- Chromatic polynomials of homeomorphism classes of graphs (Q1300985) (← links)
- A pattern for the asymptotic number of rooted maps on surfaces (Q1318367) (← links)
- A linear algorithm for analysis of minimum spanning and shortest-path trees of planar graphs (Q1322567) (← links)
- Generalized activities and \(K\)-terminal reliability. II (Q1343280) (← links)
- The random cluster process (Q1344626) (← links)