scientific article; zbMATH DE number 3882430

zbMATH Open0554.05001MaRDI QIDQ3216652FDOQ3216652

Authors: William T. Tutte 

Publication date: 1984

Title of this publication is not available (Why is that?)

Recommendations

• Graph theory. Foreword by Crispin St. J. A. Nash-Williams.
• Foreword to the special focus on graph theory and applications
• Graph theory. An introduction to proofs, algorithms, and applications
• A textbook of graph theory
• A textbook of graph theory
• Preface: Graph theory and combinatorics
• scientific article
• Graph theory. A problem oriented approach
• Graph theory. A problem oriented approach

zbMATH Keywords

textbook for advanced courses in graph theory

Mathematics Subject Classification ID

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

Cited In (only showing first 100 items - show all)

• Canonical tree-decompositions of finite graphs. II. Essential parts
• Formal specification and proofs for the topology and classification of combinatorial surfaces
• The adjacency matroid of a graph
• The structure of the models of decidable monadic theories of graphs
• Connectivity and tree structure in finite graphs
• Title not available (Why is that?)
• Title not available (Why is that?)
• Chromatic and flow polynomials of generalized vertex join graphs and outerplanar graphs
• Enumeration of 2-connected loopless 4-regular maps on the plane
• Phased graphs and graph energies
• Counting 2-connected 4-regular maps on the projective plane
• An intuitionistic proof of a discrete form of the Jordan curve theorem formalized in Coq with combinatorial hypermaps
• Polynomial invariants of graphs. II
• Hamiltonian properties of locally connected graphs with bounded vertex degree
• Canonical tree-decompositions of finite graphs. I: Existence and algorithms.
• Sur un nouvel invariant des graphes et un critère de planarité. (On a new graph invariant and a planarity criterion)
• Nonlinear dynamics of networks: the groupoid formalism
• Exact Potts model partition functions on wider arbitrary-length strips of the square lattice
• Growth rates of groups associated with face 2-coloured triangulations and directed Eulerian digraphs on the sphere
• Topological graph polynomials in colored group field theory
• Inapproximability of the Tutte polynomial
• The construction and classification of self-dual spherical polyhedra
• Structure and enumeration of two-connected graphs with prescribed three-connected components
• The number of Euler tours of random directed graphs
• General approximation schemes for min-max (regret) versions of some (pseudo-)polynomial problems
• Extending the Tutte and Bollobás–Riordan polynomials to rank 3 weakly coloured stranded graphs
• Triangulations of the sphere, bitrades and abelian groups
• Acyclic orientations and the chromatic polynomial
• A Dichromatic Polynomial for Weighted Graphs and Link Polynomials
• A rooted map invariant, non-orientability and Jack symmetric functions
• The KP hierarchy, branched covers, and triangulations
• On the sandpile group of dual graphs
• A little statistical mechanics for the graph theorist
• A combinatorial relationship between Eulerian maps and hypermaps in orientable surfaces
• Distributive lattice structure on the set of perfect matchings of carbon nanotubes
• Bounds for the coefficients of flow polynomials
• Dual graphs and knot invariants
• Near-central permutation factorization and Strahov's generalized Murnaghan-Nakayama rule
• Topological graph polynomial and quantum field theory. II: Mehler kernel theories
• Elements of a theory of simulation. II: Sequential dynamical systems.
• Plane elementary bipartite graphs
• Title not available (Why is that?)
• A linear-processor algorithm for depth-first search in planar graphs
• The double reconstruction conjecture about finite colored hypergraphs
• Forest matrices around the Laplacian matrix
• Factorization index for completely positive graphs
• Hyperbolicity cones of elementary symmetric polynomials are spectrahedral
• Asymmetric Abelian sandpile models
• Inequivalent representations of ternary matroids
• An algorithm for constructing star-shaped drawings of plane graphs
• Zeros of the Jones polynomials for families of pretzel links
• On the complexity of the independent set problem in triangle graphs
• Graphs with maximal induced matchings of the same size
• The spectrum of the Hilbert space valued second derivative with general self-adjoint boundary conditions
• Treewidth computations. I: Upper bounds
• The order of points on the second convex hull of a simple polygon
• A generalized Beraha conjecture for non-planar graphs
• Conformal covariance of the Abelian sandpile height one field
• Milnor numbers, spanning trees, and the Alexander-Conway polynomial.
• Is the five-flow conjecture almost false?
• On triangulating \(k\)-outerplanar graphs
• On terminal forms for topological polynomials for ribbon graphs: the \(N\)-petal flower
• On the spectra of nonsymmetric Laplacian matrices
• Generalized activities and the Tutte polynomial
• Sequential Monte Carlo for Sampling Balanced and Compact Redistricting Plans
• A linear algorithm for analysis of minimum spanning and shortest-path trees of planar graphs
• The transition matroid of a 4-regular graph: an introduction
• The monadic second-order logic of graphs. V: On closing the gap between definability and recognizability
• Ghost symmetry and an analogue of Steinitz's theorem
• Unimodular equivalence of graphs
• General structural results for Potts model partition functions on lattice strips
• A pattern for the asymptotic number of rooted maps on surfaces
• Description trees and Tutte formulas.
• \(K_{6}\) minors in 6-connected graphs of bounded tree-width
• Symmetries of unlabelled planar triangulations
• Exact Potts model partition function on strips of the triangular lattice
• On the Query Complexity of Testing Orientations for Being Eulerian
• Rank-width and well-quasi-ordering of skew-symmetric or symmetric matrices
• On some putative graph-theoretic counterexamples to the principle of the identity of indiscernibles
• Structure of Jackson integrals of \(BC_n\) type
• Definability equals recognizability for \(k\)-outerplanar graphs and \(l\)-chordal partial \(k\)-trees
• Title not available (Why is that?)
• Partial duality for ribbon graphs. III: A gray code algorithm for enumeration
• Parallel connections and coloured Tutte polynomials
• Detecting cycles through three fixed vertices in a graph
• Graphs that admit square 1-factorizations are hamiltonian Cayley graphs
• Quasigroup associativity and biased expansion graphs
• A note on certain de Bruijn sequences with forbidden subsequences
• Partial duality of hypermaps
• I/O-efficient algorithms for graphs of bounded treewidth
• Tensor networks and the enumerative geometry of graphs
• Strongly linear trend-free block designs and 1-factors of representative graphs
• Exact Potts model partition functions on strips of the honeycomb lattice
• The monadic second-order logic of graphs. XII: Planar graphs and planar maps
• Vertices of Localized Imbalance in a Biased Graph
• The monadic second-order logic of graphs. XI: Hierarchical decompositions of connected graphs
• Partial duality for ribbon graphs. I: distributions
• Techniques in matroid reconstruction
• On some factor theorems of graphs
• Reducible chains in several types of 2-connected graphs

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3216652)