scientific article; zbMATH DE number 3523580
From MaRDI portal
Publication:4101844
zbMATH Open0335.05101MaRDI QIDQ4101844FDOQ4101844
Robin Wilson, E. Keith Lloyd, Norman L. Biggs
Publication date: 1976
Title of this publication is not available (Why is that?)
Trees (05C05) Extremal problems in graph theory (05C35) Planar graphs; geometric and topological aspects of graph theory (05C10) Coloring of graphs and hypergraphs (05C15) Enumeration in graph theory (05C30) Graph theory (05C99) History of combinatorics (05-03)
Cited In (33)
- Partial duality for ribbon graphs. III: A gray code algorithm for enumeration
- Euler's enumerations
- Ibn Sīnā on Analysis: 1. Proof Search. Or: Abstract State Machines as a Tool for History of Logic
- An upper bound for total colouring of graphs
- Regular non-Hamiltonian polyhedral graphs
- Representation of Graphs in Diagrams of Graph Theory
- Who put the ``C in A.-T. Vandermonde ?
- Combinatorial approach to group hierarchy for stereoskeletons of ligancy 4
- Title not available (Why is that?)
- Random geometric complexes and graphs on Riemannian manifolds in the thermodynamic limit
- Subset sum problems with digraph constraints
- Partial duality for ribbon graphs. II: Partial-twuality polynomials and monodromy computations
- Matchings in regular graphs
- A contemporary Eulerian walk over the bridges of Kaliningrad
- Hamiltonian graphs from Kirkman to König
- Beyond the BEST theorem: fast assessment of Eulerian trails
- About the cover: Euler and Königsberg's Bridges: A historical view
- Explorations in the history of mathematical recreations: an introduction
- Graphs, friends and acquaintances
- Maximal strip recovery problem with gaps: hardness and approximation algorithms
- Book review of: Alexander Soifer, The mathematical coloring book. Mathematics of coloring and the colorful life of its creators
- Grinberg's criterion
- The complexity of the vertex-minor problem
- Mathematical recreations of Dénes König and his work on graph theory
- Julius Petersen 1839--1910. A biography
- Hamiltonian cycles in planar cubic graphs with facial 2‐factors, and a new partial solution of Barnette's Conjecture
- Enumerating graph embeddings and partial-duals by genus and Euler genus
- Julius Petersen's theory of regular graphs
- 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
- Polyhedra and symmetry
- On the induced matching problem in Hamiltonian bipartite graphs
- The theorem on planar graphs
- Global asymptotic stability in mean for stochastic complex networked control systems
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 Q4101844)
