scientific article; zbMATH DE number 1151365

MaRDI QIDQ4389325zbMATH OpenFDO

Authors William T. Tutte

Publication date 13 May 1998

zbMATH Keywords

chromatic polynomialsfactors in graphsmatroidsperfect rectangles and squaresplanar enumerationplanarityreconstructionsymmetries of graphsTait's conjecture for Hamiltonian circuits

Mathematics Subject Classification ID

Research exposition (monographs, survey articles) pertaining to combinatorics (05-02) Graph theory (05Cxx)

Recommendations

• scientific article; zbMATH DE number 2107985
• scientific article; zbMATH DE number 51019
• scientific article; zbMATH DE number 854567
• Elements of graph theory. From basic concepts to modern developments

Cited in

(33)

• Tutte chromatic identities from the Temperley-Lieb algebra
• Bicubic planar maps
• Arthur Cayley as Sadleirian professor: A glimpse of mathematics teaching at 19th-century Cambridge
• Characterizations of certain types of type 2 soft graphs
• Binary functions, degeneracy, and alternating dimaps
• A new type-2 soft set: type-2 soft graphs and their applications
• Graph theory -- a survey on the occasion of the Abel Prize for László Lovász
• The last temptation of William T. Tutte
• Rigidity and reconstruction for graphs
• An algebraic formulation of the graph reconstruction conjecture
• The parallel structure of mathematical reasoning
• Packing of twinned circles on a sphere
• Families of pairs of graphs with a large number of common cards
• scientific article; zbMATH DE number 3906547 (Why is no real title available?)
• On the number of dissimilar pfaffian orientations of graphs
• scientific article; zbMATH DE number 3993640 (Why is no real title available?)
• Working with Lowell
• Solving dotty problems: some puzzles in graph theory
• In the Quest for Invariant Structures Through Graph Theory, Groups and Mechanics: Methodological Aspects in the History of Applied Mathematics
• scientific article; zbMATH DE number 7266769 (Why is no real title available?)
• Optimal network topologies: expanders, cages, Ramanujan graphs, entangled networks and all that
• Subtraction-free complexity, cluster transformations, and spanning trees
• An upper bound for the number of rectangulations of a planar point set
• Enumeration of rooted 3-connected bipartite planar maps
• Matching signatures and Pfaffian graphs
• Cooperative cross-entropy method for generating entangled networks
• W. T. Tutte -- the graph theorist whose code-busting algorithms powered the D-day invasion
• Graph polynomials: some questions on the edge
• Graph polynomials and local graph operations
• Matchings: source, goal, and faithful companion
• Enumeration of fixed points of an involution on \(\beta(1,0)\)-trees
• Gray coding cubic planar maps
• A note on 3-connected cubic planar 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 Q4389325)