scientific article; zbMATH DE number 1445310
From MaRDI portal
Publication:4952623
zbMath0955.05066MaRDI QIDQ4952623
Richard Arratia, Gregory B. Sorkin, Béla Bollobás
Publication date: 13 February 2001
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Eulerian and Hamiltonian graphs (05C45)
Related Items (25)
A tight relation between series-parallel graphs and bipartite distance hereditary graphs ⋮ The complexity of counting edge colorings and a dichotomy for some higher domain Holant problems ⋮ Graph polynomials from principal pivoting ⋮ The adjacency matroid of a graph ⋮ Interlace polynomials for multimatroids and delta-matroids ⋮ From matrix pivots to graphs in surfaces: exploring combinatorics through partial duals ⋮ Farrell polynomials on graphs of bounded tree width ⋮ Nullity invariance for pivot and the interlace polynomial ⋮ Interlace polynomials ⋮ The group structure of pivot and loop complementation on graphs and set systems ⋮ Identities for circuit partition polynomials, with applications to the Tutte polynomial ⋮ Binary matroids and local complementation ⋮ On the linear algebra of local complementation ⋮ The transition matroid of a 4-regular graph: an introduction ⋮ Bipartite graphs as polynomials and polynomials as bipartite graphs ⋮ The interlace polynomial of a graph ⋮ Binary nullity, Euler circuits and interlace polynomials ⋮ The expansion of a chord diagram and the Tutte polynomial ⋮ On the interlace polynomials of forests ⋮ Alternating knot diagrams, Euler circuits and the interlace polynomial ⋮ Euler circuits and DNA sequencing by hybridization ⋮ The universal valuation of Coxeter matroids ⋮ Graph polynomials derived from Tutte-Martin polynomials ⋮ Evaluations of the circuit partition polynomial ⋮ The interlace polynomial of graphs at \(-1\)
This page was built for publication:
