Publication:3216652
From MaRDI portal
zbMath0554.05001MaRDI QIDQ3216652
Publication date: 1984
05B35: Combinatorial aspects of matroids and geometric lattices
05-01: Introductory exposition (textbooks, tutorial papers, etc.) pertaining to combinatorics
05Cxx: Graph theory
Related Items
An alternative construction of normal numbers, Acyclic orientations and the chromatic polynomial, On the difficulty of finding walks of length k, Unnamed Item, Unnamed Item, On some non-obvious connections between graphs and unary partial algebras, Ground state entropy of Potts antiferromagnets on cyclic polygon chain graphs, PARTITION FUNCTION ZEROS OF A RESTRICTED POTTS MODEL ON SELF-DUAL STRIPS OF THE SQUARE LATTICE, Nonlinear dynamics of networks: the groupoid formalism, Unnamed Item, Structural properties of Potts model partition functions and chromatic polynomials for lattice strips, Exact Potts model partition functions on strips of the honeycomb lattice, Exact Potts model partition functions on wider arbitrary-length strips of the square lattice, Routing properties of supercubes, Optimal parallel algorithms for path problems on planar graphs, Strongly linear trend-free block designs and 1-factors of representative graphs, Construction of Voronoi diagrams in the plane by using maps, Paths and cycles concerning independence edges, Merging in maps and in pavings, The structure of the models of decidable monadic theories of graphs, Isospectral flows that preserve matrix structure, Isospectral flows preserving some centrosymmetric structures, Bounds for the coefficients of flow polynomials, A rooted map invariant, non-orientability and Jack symmetric functions, The construction and classification of self-dual spherical polyhedra, The double reconstruction conjecture about finite colored hypergraphs, Inapproximability of the Tutte polynomial, The KP hierarchy, branched covers, and triangulations, Connectivity in frame matroids, Cubic combinatorial maps, A linear-processor algorithm for depth-first search in planar graphs, Generalized activities and the Tutte polynomial, The monadic second-order logic of graphs. V: On closing the gap between definability and recognizability, Elementary divisors of graphs and matroids, On some factor theorems of graphs, Generalized activities and \(K\)-terminal reliability, Unimodular equivalence of graphs, Detecting cycles through three fixed vertices in a graph, Reducible chains in several types of 2-connected graphs, Pre-Regge calculus: Topology via logic, Computing with graph rewriting systems with priorities, Asymmetric Abelian sandpile models, On the rooted Tutte polynomial, A combinatorial relationship between Eulerian maps and hypermaps in orientable surfaces, Minor-equivalence for infinite graphs, Chromatic polynomials of homeomorphism classes of graphs, A pattern for the asymptotic number of rooted maps on surfaces, A linear algorithm for analysis of minimum spanning and shortest-path trees of planar graphs, Generalized activities and \(K\)-terminal reliability. II, The random cluster process, Enumeration of 2-connected loopless 4-regular maps on the plane, Techniques in matroid reconstruction, Graph-theoretic interpretation of the generalized row sum method, The two-convex-polygons TSP: A solvable case, A monadic second-order definition of the structure of convex hypergraphs., Zeros of the Jones polynomials for families of pretzel links, Milnor numbers, spanning trees, and the Alexander-Conway polynomial., Tension-flow polynomials on graphs, Hamiltonian knot projections and lengths of thick knots., Factorization index for completely positive graphs, The monadic second-order logic of graphs. XII: Planar graphs and planar maps, On the sandpile group of dual graphs, Elements of a theory of simulation. II: Sequential dynamical systems., A new lower bound for the bipartite crossing number with applications, Maximum genus, girth and connectivity, Exact Potts model partition function on strips of the triangular lattice, Plane elementary bipartite graphs, All wheels with two missing consecutive spokes are chromatically unique, Parallel connections and coloured Tutte polynomials, On the spectra of nonsymmetric Laplacian matrices, A new proof of the Gauss interlace conjecture, On graph invariants given by linear recurrence relations, Sur un nouvel invariant des graphes et un critère de planarité. (On a new graph invariant and a planarity criterion), General structural results for Potts model partition functions on lattice strips, Polynomials associated with nowhere-zero flows, The quadrangulation conjecture for orientable surfaces, Description trees and Tutte formulas., Forest matrices around the Laplacian matrix, A tight lower bound on the maximum genus of \(3\)-edge connected loopless graphs, Upon the removal of the edges of a 1-factor from an even circuit in a 2-connected graph, On removable even circuits in graphs, The order of points on the second convex hull of a simple polygon, An optimal parallel algorithm for planar cycle separators, Simulation of the quasi-static mechanics and scalar transport properties of ideal granular assemblages, Graphs that admit square 1-factorizations are hamiltonian Cayley graphs, Maximum genus and connectivity, Inequivalent representations of ternary matroids, Polynomial invariants of graphs. II, The monadic second-order logic of graphs. XI: Hierarchical decompositions of connected graphs, Dual graphs and knot invariants, Removable edges in a 5-connected graph and a construction method of 5-connected graphs, Decomposition formulas for the flow polynomial, Decompositions of signed-graphic matroids, Subdivisions de surfaces et cartes généralisées de dimension 2, A Dichromatic Polynomial for Weighted Graphs and Link Polynomials, The non-solvability by radicals of generic 3-connected planar Laman graphs, Quasigroup associativity and biased expansion graphs, Euclidean minima of totally real number fields: Algorithmic determination, On the Query Complexity of Testing Orientations for Being Eulerian, Vertices of Localized Imbalance in a Biased Graph, A Greedoid Polynomial Which Distinguishes Rooted Arborescences, Solides non organisés : définition, implantation et plongement
