scientific article; zbMATH DE number 3523580

Robin J. Wilson, E. Keith Lloyd, Norman L. Biggs

Publication date: 1976

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

Trees (05C05) Extremal problems in graph theory (05C35) Enumeration in graph theory (05C30) Planar graphs; geometric and topological aspects of graph theory (05C10) Coloring of graphs and hypergraphs (05C15) Graph theory (05C99) History of combinatorics (05-03)

Related Items (33)

Partial duality for ribbon graphs. III: A gray code algorithm for enumeration ⋮ Grinberg's criterion ⋮ Subset sum problems with digraph constraints ⋮ Beyond the BEST theorem: fast assessment of Eulerian trails ⋮ Who put the ``C in A.-T. Vandermonde ? ⋮ Euler's enumerations ⋮ Enumerating graph embeddings and partial-duals by genus and Euler genus ⋮ Representation of Graphs in Diagrams of Graph Theory ⋮ Hamiltonian cycles in planar cubic graphs with facial 2‐factors, and a new partial solution of Barnette's Conjecture ⋮ About the cover: Euler and Königsberg's Bridges: A historical view ⋮ Matchings in regular graphs ⋮ Maximal strip recovery problem with gaps: hardness and approximation algorithms ⋮ Explorations in the history of mathematical recreations: an introduction ⋮ Mathematical recreations of Dénes König and his work on graph theory ⋮ Combinatorial enumeration of three-dimensional trees as stereochemical models of alkanes: An approach based on Fujita's proligand method and dual recognition as uninuclear and binuclear promolecules ⋮ Book review of: Alexander Soifer, The mathematical coloring book. Mathematics of coloring and the colorful life of its creators ⋮ Random geometric complexes and graphs on Riemannian manifolds in the thermodynamic limit ⋮ Julius Petersen 1839--1910. A biography ⋮ Julius Petersen's theory of regular graphs ⋮ An upper bound for total colouring of graphs ⋮ Ibn Sīnā on Analysis: 1. Proof Search. Or: Abstract State Machines as a Tool for History of Logic ⋮ Partial duality for ribbon graphs. II: Partial-twuality polynomials and monodromy computations ⋮ A contemporary Eulerian walk over the bridges of Kaliningrad ⋮ The complexity of the vertex-minor problem ⋮ On the induced matching problem in Hamiltonian bipartite graphs ⋮ Global asymptotic stability in mean for stochastic complex networked control systems ⋮ Unnamed Item ⋮ Regular non-Hamiltonian polyhedral graphs ⋮ Polyhedra and symmetry ⋮ Graphs, friends and acquaintances ⋮ Hamiltonian graphs from Kirkman to König ⋮ The theorem on planar graphs ⋮ Combinatorial approach to group hierarchy for stereoskeletons of ligancy 4

This page was built for publication: