scientific article; zbMATH DE number 1151365
From MaRDI portal
Publication:4389325
zbMath0915.05041MaRDI QIDQ4389325
Publication date: 13 May 1998
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
matroidsplanarityreconstructionchromatic polynomialsfactors in graphsperfect rectangles and squaresplanar enumerationsymmetries of graphsTait's conjecture for Hamiltonian circuits
Research exposition (monographs, survey articles) pertaining to combinatorics (05-02) Graph theory (05Cxx)
Related Items
Graph theory -- a survey on the occasion of the Abel Prize for László Lovász, The Parallel Structure of Mathematical Reasoning, Packing of twinned circles on a sphere, An upper bound for the number of rectangulations of a planar point set, Matching signatures and Pfaffian graphs, Gray coding cubic planar maps, In the Quest for Invariant Structures Through Graph Theory, Groups and Mechanics: Methodological Aspects in the History of Applied Mathematics, Characterizations of certain types of type 2 soft graphs, Binary functions, degeneracy, and alternating dimaps, Cooperative cross-entropy method for generating entangled networks, Families of pairs of graphs with a large number of common cards, A note on 3-connected cubic planar graphs, On the number of dissimilar pfaffian orientations of graphs, A new type-2 soft set: type-2 soft graphs and their applications, Subtraction-free complexity, cluster transformations, and spanning trees, An Algebraic Formulation of the Graph Reconstruction Conjecture, Tutte chromatic identities from the Temperley-Lieb algebra, Enumeration of fixed points of an involution on \(\beta(1,0)\)-trees, Optimal network topologies: expanders, cages, Ramanujan graphs, entangled networks and all that, Rigidity and reconstruction for graphs, Bicubic planar maps, Arthur Cayley as Sadleirian professor: A glimpse of mathematics teaching at 19th-century Cambridge, Enumeration of rooted 3-connected bipartite planar maps
