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)

• 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
• Maximum genus, girth and connectivity
• Pre-Regge calculus: Topology via logic
• A new proof of the Gauss interlace conjecture
• Fusion graphs: merging properties and watersheds
• Maximum genus and connectivity
• Isospectral flows preserving some centrosymmetric structures
• Decompositions of signed-graphic matroids
• Routing properties of supercubes
• Hamiltonian knot projections and lengths of thick knots.
• PARTITION FUNCTION ZEROS OF A RESTRICTED POTTS MODEL ON SELF-DUAL STRIPS OF THE SQUARE LATTICE
• Cubic combinatorial maps
• Structural properties of Potts model partition functions and chromatic polynomials for lattice strips
• Relational networks of conditional preferences
• The non-solvability by radicals of generic 3-connected planar Laman graphs
• Tension-flow polynomials on graphs
• Decomposition formulas for the flow polynomial
• Construction of Voronoi diagrams in the plane by using maps
• Paths and cycles concerning independence edges
• Merging in maps and in pavings
• Removable edges in a 5-connected graph and a construction method of 5-connected graphs
• Realizations of branched self-coverings of the 2-sphere
• Ground state entropy of Potts antiferromagnets on cyclic polygon chain graphs
• Connectivity in frame matroids
• A Greedoid Polynomial Which Distinguishes Rooted Arborescences
• Minor-equivalence for infinite graphs
• The cactus tree of a metric space
• Simulation of the quasi-static mechanics and scalar transport properties of ideal granular assemblages
• Extending Steinitz's theorem to upward star-shaped polyhedra and spherical polyhedra
• Subtraction-free complexity, cluster transformations, and spanning trees
• The Painter’s Problem: Covering a Grid with Colored Connected Polygons
• Dynamic planar embeddings of dynamic graphs
• Euclidean minima of totally real number fields: Algorithmic determination
• Genus expansion for real Wishart matrices
• Packing non-zero \(A\)-paths in an undirected model of group labeled graphs
• Isospectral flows that preserve matrix structure
• Chromatic polynomials of homeomorphism classes of graphs
• Restricted non-separable planar maps and some pattern avoiding permutations
• Annular embeddings of permutations for arbitrary genus
• Polynomials associated with nowhere-zero flows
• Title not available (Why is that?)
• On removable even circuits in graphs
• Combinatorial theory of the semiclassical evaluation of transport moments II: Algorithmic approach for moment generating functions
• Optimal parallel algorithms for path problems on planar graphs
• All wheels with two missing consecutive spokes are chromatically unique
• Memory efficient algorithms for cactus graphs and block graphs
• 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

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)