scientific article; zbMATH DE number 5057517

zbMath1101.05054MaRDI QIDQ5491020

Robin Thomas

Publication date: 26 September 2006

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

matchingcrossing numberdimer problembracebricksign-nonsingular matrixeven directed cyclePólya's permanent problem

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Paths and cycles (05C38) Planar graphs; geometric and topological aspects of graph theory (05C10) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Lattice systems (Ising, dimer, Potts, etc.) and systems on graphs arising in equilibrium statistical mechanics (82B20) Structural characterization of families of graphs (05C75) Graph minors (05C83) Graph algorithms (graph-theoretic aspects) (05C85) Directed graphs (digraphs), tournaments (05C20)

Related Items

GENERALIZED DOMINOES TILING'S MARKOV CHAIN MIXES FAST, Diagram monoids and Graham-Houghton graphs: idempotents and generating sets of ideals, Matching structure of symmetric bipartite graphs and a generalization of Pólya's problem, Pfaffian graphs embedding on the torus, On the optimality of the Arf invariant formula for graph polynomials, The complexity of generalized domino tilings, The Pfaffian property of graphs on the Möbius strip based on topological resolution, The Pfaffian property of Cayley graphs on dihedral groups, Undirected determinant and its complexity, Enumeration of perfect matchings of the Cartesian products of graphs, Pfaffian polyominos on the Klein bottle, The Pfaffian property of circulant graphs, Face-width of Pfaffian braces and polyhex graphs on surfaces, Minimally non-Pfaffian graphs, Pfaffian graphs, \(T\)-joins and crossing numbers, Pfaffian labelings and signs of edge colorings, Adinkras for mathematicians, Pentagon contact representations, Computing rank-width exactly, Spanning trees of 3-uniform hypergraphs, Unnamed Item, Colouring non-even digraphs, Oriented Euler complexes and signed perfect matchings, Odd \(K_{3,3}\) subdivisions in bipartite graphs