The following pages link to (Q5601344):
Displayed 37 items.
- Variations on a theme of Kasteleyn, with application to the totally nonnegative Grassmannian (Q281632) (← links)
- Partitioning planar graphs: a fast combinatorial approach for max-cut (Q434180) (← links)
- Matching signatures and Pfaffian graphs (Q626770) (← links)
- Matchings in pentagonal chains (Q791538) (← links)
- Topological mappings between graphs, trees and generalized trees (Q884588) (← links)
- Finding a maximum independent set in a permutation graph (Q916397) (← links)
- Embedding and characterization of quantum chemical reaction graphs on two-dimensional orientable surfaces (Q1095919) (← links)
- Interacting dimers on a Sierpinski gasket (Q1095958) (← links)
- Enumeration of coloured plane trees with a given type partition (Q1146687) (← links)
- Paving the chessboard (Q1160134) (← links)
- Enumerations of rooted trees with an application to group presentations (Q1170253) (← links)
- The functorial composition of species, a forgotten operation (Q1191940) (← links)
- Significance arithmetic: The probability of carrying (Q1243504) (← links)
- An extension of the Dulmage-Mendelsohn theorem (Q1260087) (← links)
- Subgraph generating functions in chemistry---an example for perfect matchings on honeycomb fragments (Q1310242) (← links)
- New formulae for the decycling number of graphs (Q1630929) (← links)
- Extremal hexagonal chains with respect to the coefficients sum of the permanental polynomial (Q1733727) (← links)
- A note on decycling number, vertex partition and AVD-total coloring in graphs (Q1756100) (← links)
- Exact partition functions and correlation functions of multiple Hamiltonian walks on the Manhattan lattice. (Q1963648) (← links)
- Dichotomy for Holant\(^\ast\) problems on the Boolean domain (Q2032295) (← links)
- Nonseparating independent sets and maximum genus of graphs (Q2155662) (← links)
- Bijections between directed animals, multisets and Grand-Dyck paths (Q2181997) (← links)
- The free-fermion eight-vertex model: couplings, bipartite dimers and \(Z\)-invariance (Q2223720) (← links)
- Exploiting partial correlations in distributionally robust optimization (Q2227536) (← links)
- Combinatorial approach to group hierarchy for stereoskeletons of ligancy 4 (Q2353556) (← links)
- Maximum matchings in planar graphs via Gaussian elimination (Q2369872) (← links)
- Information theoretic measures of UHG graphs with low computational complexity (Q2383930) (← links)
- A new formula for the decycling number of regular graphs (Q2404396) (← links)
- The number of connected graphs with \(k\) cycles on labeled nodes (Q2555870) (← links)
- Group theoretical and combinatorial analysis of histocompatibility and switching algebra (Q2559319) (← links)
- Orthogonal polynomials through complex matrix graph theory (Q2679265) (← links)
- Barnette's conjecture through the lens of the \(Mod_k P\) complexity classes (Q2695474) (← links)
- On the Pfaffian Number of Graphs (Q2840532) (← links)
- On maximum signless Laplacian Estrada index of graphs with given parameters II (Q5009979) (← links)
- On δ(k)-coloring of powers of helm and closed helm graphs (Q5063299) (← links)
- A Pfaffian formula for the Ising partition function of surface graphs (Q5856867) (← links)
- Graph theory (Q5917392) (← links)