scientific article; zbMATH DE number 3321957

zbMATH Open0202.55602MaRDI QIDQ5601344FDOQ5601344

Authors:

Publication date: 1967

Title of this publication is not available (Why is that?)

Mathematics Subject Classification ID

Collections of articles of miscellaneous specific interest (00B15) Proceedings, conferences, collections, etc. pertaining to combinatorics (05-06) Graph theory (05Cxx)

Cited In (39)

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

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)