scientific article; zbMATH DE number 3321957
From MaRDI portal
Publication:5601344
Cited in
(44)- Embedding and characterization of quantum chemical reaction graphs on two-dimensional orientable surfaces
- Interacting dimers on a Sierpinski gasket
- Enumeration of coloured plane trees with a given type partition
- Paving the chessboard
- Enumerations of rooted trees with an application to group presentations
- The functorial composition of species, a forgotten operation
- Significance arithmetic: The probability of carrying
- An extension of the Dulmage-Mendelsohn theorem
- Subgraph generating functions in chemistry---an example for perfect matchings on honeycomb fragments
- New formulae for the decycling number of graphs
- Extremal hexagonal chains with respect to the coefficients sum of the permanental polynomial
- A note on decycling number, vertex partition and AVD-total coloring in graphs
- Exact partition functions and correlation functions of multiple Hamiltonian walks on the Manhattan lattice.
- Dichotomy for Holant\(^\ast\) problems on the Boolean domain
- Nonseparating independent sets and maximum genus of graphs
- Bijections between directed animals, multisets and Grand-Dyck paths
- The free-fermion eight-vertex model: couplings, bipartite dimers and \(Z\)-invariance
- Exploiting partial correlations in distributionally robust optimization
- Combinatorial approach to group hierarchy for stereoskeletons of ligancy 4
- Maximum matchings in planar graphs via Gaussian elimination
- Information theoretic measures of UHG graphs with low computational complexity
- A new formula for the decycling number of regular graphs
- The number of connected graphs with \(k\) cycles on labeled nodes
- Group theoretical and combinatorial analysis of histocompatibility and switching algebra
- Orthogonal polynomials through complex matrix graph theory
- Barnette's conjecture through the lens of the Mod_k P complexity classes
- Variations on a theme of Kasteleyn, with application to the totally nonnegative Grassmannian
- On the Pfaffian number of graphs
- Partitioning planar graphs: a fast combinatorial approach for max-cut
- On maximum signless Laplacian Estrada index of graphs with given parameters. II
- On \(\delta^{(k)}\)-coloring of powers of helm and closed helm graphs
- A Pfaffian formula for the Ising partition function of surface graphs
- Graph theory
- Matching signatures and Pfaffian graphs
- The number of spanning trees in K_n-complement of a bipartite graph
- On \(\delta^{(k)}\)-colouring of some wheel related graphs
- Dimers and M-curves
- Further results on enumeration of perfect matchings of Cartesian product graphs
- A characterization on Pfaffian graphs of Cartesian product \(G\times C_{2 n + 1}\)
- Decycling number of type-k Halin graphs
- Correlation trends between the Ising critical temperature and the corresponding spanning tree constant
- Matchings in pentagonal chains
- Topological mappings between graphs, trees and generalized trees
- Finding a maximum independent set in a permutation graph
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5601344)
