The following pages link to (Q3216652):
Displaying 50 items.
- 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)
- Enumeration of 2-connected loopless 4-regular maps on the plane (Q1348772) (← links)
- Techniques in matroid reconstruction (Q1363660) (← links)
- Graph-theoretic interpretation of the generalized row sum method (Q1366887) (← links)
- The two-convex-polygons TSP: A solvable case (Q1367695) (← links)
- A monadic second-order definition of the structure of convex hypergraphs. (Q1400707) (← links)
- Zeros of the Jones polynomials for families of pretzel links (Q1409032) (← links)
- Milnor numbers, spanning trees, and the Alexander-Conway polynomial. (Q1421392) (← links)
- Tension-flow polynomials on graphs (Q1421520) (← links)
- Hamiltonian knot projections and lengths of thick knots. (Q1421985) (← links)
- Factorization index for completely positive graphs (Q1566006) (← links)
- The monadic second-order logic of graphs. XII: Planar graphs and planar maps (Q1566702) (← links)
- On the sandpile group of dual graphs (Q1568782) (← links)
- Elements of a theory of simulation. II: Sequential dynamical systems. (Q1569128) (← links)
- A new lower bound for the bipartite crossing number with applications (Q1575746) (← links)
- Maximum genus, girth and connectivity (Q1580675) (← links)
- Exact Potts model partition function on strips of the triangular lattice (Q1581535) (← links)
- Plane elementary bipartite graphs (Q1582086) (← links)
- All wheels with two missing consecutive spokes are chromatically unique (Q1584221) (← links)
- The category of node-and-choice preforms for extensive-form games (Q1615994) (← links)
