scientific article

Publication date: 1984

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

textbook for advanced courses in graph theory

Combinatorial aspects of matroids and geometric lattices (05B35) Introductory exposition (textbooks, tutorial papers, etc.) pertaining to combinatorics (05-01) Graph theory (05Cxx)

Related Items

Refining a Tree-Decomposition which Distinguishes Tangles, 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, Universal Tutte polynomial, PARTITION FUNCTION ZEROS OF A RESTRICTED POTTS MODEL ON SELF-DUAL STRIPS OF THE SQUARE LATTICE, Solides non organisés : définition, implantation et plongement, Dispersal routes reconstruction and the minimum cost arborescence problem, The order of points on the second convex hull of a simple polygon, Tensor networks and the enumerative geometry of graphs, Improved parallel depth-first search in undirected planar graphs, Negative (and positive) circles in signed graphs: a problem collection, An optimal parallel algorithm for planar cycle separators, On some non-obvious connections between graphs and unary partial algebras, Decompositions of signed-graphic matroids, Simulation of the quasi-static mechanics and scalar transport properties of ideal granular assemblages, Graphs that admit square 1-factorizations are hamiltonian Cayley graphs, On graphs whose flow polynomials have real roots only, Maximum genus and connectivity, Inequivalent representations of ternary matroids, Unnamed Item, Polynomial invariants of graphs. II, Algorithm for identifying minimum driver nodes based on structural controllability, The language of self-avoiding walks, Definability equals recognizability for \(k\)-outerplanar graphs and \(l\)-chordal partial \(k\)-trees, Signed-graphic matroids with all-graphic cocircuits, Network formation under linking constraints, On inverse topology problem for Laplace operators on graphs, Conformal Decomposition of Integral Tensions and Potentials of Signed Graphs, \(K_{6}\) minors in 6-connected graphs of bounded tree-width, Uniqueness of the infinite noodle, Dynamic planar embeddings of dynamic graphs, Generalizing Kirchhoff laws for Signed Graphs, Rank-width and well-quasi-ordering of skew-symmetric or symmetric matrices, Relational networks of conditional preferences, Symmetries of unlabelled planar triangulations, Local convergence of random planar graphs, The smooth structure of the moduli space of a weighted series-parallel graph, The spectrum of the Hilbert space valued second derivative with general self-adjoint boundary conditions, Graphs with no \(K_{3,3}\) minor containing a fixed edge, On terminal forms for topological polynomials for ribbon graphs: the \(N\)-petal flower, The monadic second-order logic of graphs. XI: Hierarchical decompositions of connected graphs, Restricted non-separable planar maps and some pattern avoiding permutations, The Painter’s Problem: Covering a Grid with Colored Connected Polygons, An Elementary Proof of a Matrix Tree Theorem for Directed Graphs, On the Query Complexity of Testing Orientations for Being Eulerian, A note on “A linear‐size zero‐one programming model for the minimum spanning tree problem in planar graphs”, Dual graphs and knot invariants, An introduction to the k-defect polynomials, 4-edge-connected 4-regular maps on the projective plane, The Category of Node-and-Choice Forms, with Subcategories for Choice-Sequence Forms and Choice-Set Forms, Renormalization and Periods in Perturbative Algebraic Quantum Field Theory, DONAGHEY’S TRANSFORMATION: CAROUSEL EFFECTS AND TAME COMPONENTS, On abstraction in mathematics and indefiniteness in quantum mechanics, Partial duality for ribbon graphs. I: distributions, Duality and the signed Laplacian matrix of a graph, Planar transitive graphs, Combinatorial theory of the semiclassical evaluation of transport moments. I. Equivalence with the random matrix approach, On the difficulty of finding walks of length k, Removable edges in a 5-connected graph and a construction method of 5-connected graphs, On zero-free intervals of flow polynomials, Parallel connections and coloured Tutte polynomials, On the spectra of nonsymmetric Laplacian matrices, On the complexity of the independent set problem in triangle graphs, Ground state entropy of Potts antiferromagnets on cyclic polygon chain graphs, Subdivisions de surfaces et cartes généralisées de dimension 2, A Dichromatic Polynomial for Weighted Graphs and Link Polynomials, Vertices of Localized Imbalance in a Biased Graph, Unified approach to critical-contrast homogenisation with explicit links to time-dispersive media, Lehmer's question, graph complexity growth and links, A new proof of the Gauss interlace conjecture, Incidence hypergraphs: injectivity, uniformity, and matrix-tree theorems, Distributions of near-4-regular maps on the sphere and the projective plane, 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), The Power of the Weisfeiler-Leman Algorithm to Decompose Graphs, Oriented hypergraphic matrix-tree type theorems and bidirected minors via Boolean order ideals, Characterizing attitudinal network graphs through frustration cloud, Unnamed Item, Metric graphs, cross ratios, and Rayleigh's laws, Feynman Graphs, Decomposition formulas for the flow polynomial, The non-solvability by radicals of generic 3-connected planar Laman graphs, Trees and forests for nonequilibrium purposes: an introduction to graphical representations, General structural results for Potts model partition functions on lattice strips, Polynomials associated with nowhere-zero flows, The quadrangulation conjecture for orientable surfaces, On graphs having no flow roots in the interval \((1,2)\), Quasigroup associativity and biased expansion graphs, Description trees and Tutte formulas., Euclidean minima of totally real number fields: Algorithmic determination, Forest matrices around the Laplacian matrix, Partial duality of hypermaps, Generating the cycle space of planar graphs, A Greedoid Polynomial Which Distinguishes Rooted Arborescences, Enumeration of labeled block-cactus graphs, A tight lower bound on the maximum genus of \(3\)-edge connected loopless graphs, Counting cliques in 1-planar graphs, Universality for polynomial invariants for ribbon graphs with half-ribbons, Homology of cellular structures allowing multi-incidence, The Power of the Weisfeiler--Leman Algorithm to Decompose Graphs, Comparing Wiener, Szeged and revised Szeged index on cactus graphs, Extending the Tutte and Bollobás–Riordan polynomials to rank 3 weakly coloured stranded graphs, Transformation invariance in the combinatorial Nullstellensatz and nowhere-zero points of non-singular matrices, Hochschild cohomology of symmetric groups and generating functions, Combinatorial theory of the semiclassical evaluation of transport moments II: Algorithmic approach for moment generating functions, 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, An alternative construction of normal numbers, Acyclic orientations and the chromatic polynomial, Subtraction-free complexity, cluster transformations, and spanning trees, Inequivalent factorizations of permutations, A generalized Beraha conjecture for non-planar graphs, Nonlinear dynamics of networks: the groupoid formalism, Unnamed Item, Global dynamics and bifurcation analysis of an insect-borne plant disease model with two transmission routes, Chromatic and flow polynomials of generalized vertex join graphs and outerplanar graphs, The category of node-and-choice preforms for extensive-form games, Partial duality for ribbon graphs. III: A gray code algorithm for enumeration, Growth rates of groups associated with face 2-coloured triangulations and directed Eulerian digraphs on the sphere, I/O-efficient algorithms for graphs of bounded treewidth, Distributive lattice structure on the set of perfect matchings of carbon nanotubes, An intuitionistic proof of a discrete form of the Jordan curve theorem formalized in Coq with combinatorial hypermaps, Generalized activities and \(K\)-terminal reliability. II, The random cluster process, Conformal covariance of the Abelian sandpile height one field, Enumeration of 2-connected loopless 4-regular maps on the plane, Techniques in matroid reconstruction, A linear-processor algorithm for depth-first search in planar graphs, Graphs with maximal induced matchings of the same size, Graph-theoretic interpretation of the generalized row sum method, The two-convex-polygons TSP: A solvable case, 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, On some putative graph-theoretic counterexamples to the principle of the identity of indiscernibles, Formal specification and proofs for the topology and classification of combinatorial surfaces, The number of Euler tours of random directed graphs, The adjacency matroid of a graph, Connectivity and tree structure in finite graphs, Realizations of branched self-coverings of the 2-sphere, Counting 2-connected 4-regular maps on the projective plane, Canonical tree-decompositions of finite graphs. I: Existence and algorithms., A monadic second-order definition of the structure of convex hypergraphs., Topological graph polynomials in colored group field theory, Zeros of the Jones polynomials for families of pretzel links, General approximation schemes for min-max (regret) versions of some (pseudo-)polynomial problems, The construction and classification of self-dual spherical polyhedra, The double reconstruction conjecture about finite colored hypergraphs, The cactus tree of a metric space, Near-central permutation factorization and Strahov's generalized Murnaghan-Nakayama rule, Hamiltonian properties of locally connected graphs with bounded vertex degree, Phased graphs and graph energies, Milnor numbers, spanning trees, and the Alexander-Conway polynomial., Tension-flow polynomials on graphs, Hamiltonian knot projections and lengths of thick knots., Is the five-flow conjecture almost false?, Extending Steinitz's theorem to upward star-shaped polyhedra and spherical polyhedra, Generalized activities and the Tutte polynomial, The monadic second-order logic of graphs. V: On closing the gap between definability and recognizability, On triangulating \(k\)-outerplanar graphs, Hyperbolicity cones of elementary symmetric polynomials are spectrahedral, Elementary divisors of graphs and matroids, Genus expansion for real Wishart matrices, Triangulations of the sphere, bitrades and abelian groups, Inapproximability of the Tutte polynomial, The transition matroid of a 4-regular graph: an introduction, On some factor theorems of graphs, Generalized activities and \(K\)-terminal reliability, Optimal parallel algorithms for path problems on planar graphs, The KP hierarchy, branched covers, and triangulations, Unimodular equivalence of graphs, Connectivity in frame matroids, Detecting cycles through three fixed vertices in a graph, Reducible chains in several types of 2-connected graphs, Sequential Monte Carlo for Sampling Balanced and Compact Redistricting Plans, Memory efficient algorithms for cactus graphs and block graphs, Treewidth computations. I: Upper bounds, Topological graph polynomial and quantum field theory. II: Mehler kernel theories, Annular embeddings of permutations for arbitrary genus, Packing non-zero \(A\)-paths in an undirected model of group labeled graphs, Ghost symmetry and an analogue of Steinitz's theorem, A note on certain de Bruijn sequences with forbidden subsequences, Pre-Regge calculus: Topology via logic, Strongly linear trend-free block designs and 1-factors of representative graphs, A little statistical mechanics for the graph theorist, Fusion graphs: merging properties and watersheds, Structure of Jackson integrals of \(BC_n\) type, Computing with graph rewriting systems with priorities, Testing planarity of geometric automorphisms in linear time, Construction of Voronoi diagrams in the plane by using maps, Structure and enumeration of two-connected graphs with prescribed three-connected components, Paths and cycles concerning independence edges, Asymmetric Abelian sandpile models, 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., An algorithm for constructing star-shaped drawings of plane graphs, A new lower bound for the bipartite crossing number with applications, Flows, flow-pair covers and cycle double covers, Maximum genus, girth and connectivity, Exact Potts model partition function on strips of the triangular lattice, Plane elementary bipartite graphs, On the rooted Tutte polynomial, A combinatorial relationship between Eulerian maps and hypermaps in orientable surfaces, Minor-equivalence for infinite graphs, All wheels with two missing consecutive spokes are chromatically unique, Chromatic polynomials of homeomorphism classes of graphs, Merging in maps and in pavings, A pattern for the asymptotic number of rooted maps on surfaces, The structure of the models of decidable monadic theories of graphs, A linear algorithm for analysis of minimum spanning and shortest-path trees of planar graphs, Cubic combinatorial maps, Canonical tree-decompositions of finite graphs. II. Essential parts