Publication | Date of Publication | Type |
---|
https://portal.mardi4nfdi.de/entity/Q3118114 | 2012-03-01 | Paper |
A note on chain lengths and the Tutte polynomial | 2008-11-12 | Paper |
https://portal.mardi4nfdi.de/entity/Q5704415 | 2005-11-15 | Paper |
https://portal.mardi4nfdi.de/entity/Q5463586 | 2005-08-04 | Paper |
https://portal.mardi4nfdi.de/entity/Q4458212 | 2004-03-17 | Paper |
The asymptotic number of claw-free cubic graphs. | 2003-12-04 | Paper |
Chain polynomials of graphs | 2003-05-25 | Paper |
Counting Claw-Free Cubic Graphs | 2003-01-05 | Paper |
The Tutte polynomial for homeomorphism classes of graphs | 2002-07-03 | Paper |
Cellular structures determined by polygons and trees | 2002-04-21 | Paper |
Graph theory and the amateur cryptographer | 2000-11-26 | Paper |
Chromatic polynomials of homeomorphism classes of graphs | 1999-09-02 | Paper |
https://portal.mardi4nfdi.de/entity/Q4223159 | 1998-12-15 | Paper |
https://portal.mardi4nfdi.de/entity/Q4342016 | 1997-07-01 | Paper |
A note on the Stockhausen problem | 1997-06-25 | Paper |
Combinatorial problems in the theory of music | 1997-06-09 | Paper |
Chemistry and discrete mathematics | 1996-11-21 | Paper |
https://portal.mardi4nfdi.de/entity/Q4873772 | 1996-04-22 | Paper |
https://portal.mardi4nfdi.de/entity/Q4846496 | 1995-11-26 | Paper |
https://portal.mardi4nfdi.de/entity/Q3139764 | 1994-11-29 | Paper |
https://portal.mardi4nfdi.de/entity/Q4304427 | 1994-09-12 | Paper |
Balancing the \(n\)-cube: A census of colorings | 1994-02-02 | Paper |
https://portal.mardi4nfdi.de/entity/Q5752588 | 1990-01-01 | Paper |
A note on the chromatic uniqueness of \(W_ 10\) | 1988-01-01 | Paper |
https://portal.mardi4nfdi.de/entity/Q3819084 | 1988-01-01 | Paper |
https://portal.mardi4nfdi.de/entity/Q4734776 | 1988-01-01 | Paper |
https://portal.mardi4nfdi.de/entity/Q3757930 | 1987-01-01 | Paper |
Pólya's Theorem and Its Progeny | 1987-01-01 | Paper |
https://portal.mardi4nfdi.de/entity/Q3792702 | 1987-01-01 | Paper |
On the construction and enumeration of minimal blocks | 1987-01-01 | Paper |
https://portal.mardi4nfdi.de/entity/Q3832608 | 1987-01-01 | Paper |
On the enumeration of a class of plane multigraphs | 1986-01-01 | Paper |
https://portal.mardi4nfdi.de/entity/Q3728929 | 1986-01-01 | Paper |
Cataloguing the graphs on 10 vertices | 1985-01-01 | Paper |
Some Hamilton Paths and a Minimal Change Algorithm | 1984-01-01 | Paper |
The enumeration of transitive selfcomplementary digraphs | 1983-01-01 | Paper |
Enumeration of labelled multigraphs by degree parities | 1982-01-01 | Paper |
The enumeration of stack polytopes and simplicial clusters | 1982-01-01 | Paper |
The dimer problem for narrow rectangular arrays: A unified method of solution, and some extensions | 1982-01-01 | Paper |
https://portal.mardi4nfdi.de/entity/Q3309852 | 1982-01-01 | Paper |
Orientations of circle graphs | 1982-01-01 | Paper |
Counting the 10-point graphs by partition | 1981-01-01 | Paper |
https://portal.mardi4nfdi.de/entity/Q3924228 | 1981-01-01 | Paper |
https://portal.mardi4nfdi.de/entity/Q3963031 | 1981-01-01 | Paper |
https://portal.mardi4nfdi.de/entity/Q3863906 | 1980-01-01 | Paper |
Number of labeled 4-regular graphs | 1980-01-01 | Paper |
Orderly algorithms for graph generation | 1979-01-01 | Paper |
On the construction of the self-complementary graphs on 12 nodes | 1979-01-01 | Paper |
https://portal.mardi4nfdi.de/entity/Q3889077 | 1979-01-01 | Paper |
https://portal.mardi4nfdi.de/entity/Q3936740 | 1979-01-01 | Paper |
Orderly algorithms for generating restricted classes of graphs | 1979-01-01 | Paper |
A note on permutations without runs of given length | 1978-01-01 | Paper |
On general dissections of a polygon | 1978-01-01 | Paper |
https://portal.mardi4nfdi.de/entity/Q3877716 | 1978-01-01 | Paper |
https://portal.mardi4nfdi.de/entity/Q4172067 | 1978-01-01 | Paper |
Every one a Winner or how to Avoid Isomorphism Search when Cataloguing Combinatorial Configurations | 1978-01-01 | Paper |
On the Principal Edge Tripartition of a Graph | 1978-01-01 | Paper |
The graph isomorphism disease | 1977-01-01 | Paper |
On the cell-growth problem for arbitrary polygons | 1975-01-01 | Paper |
Bounds on Backtrack Algorithms for Listing Cycles, Paths, and Spanning Trees | 1975-01-01 | Paper |
https://portal.mardi4nfdi.de/entity/Q4044590 | 1974-01-01 | Paper |
On the Number of Plane 2-Trees | 1973-01-01 | Paper |
https://portal.mardi4nfdi.de/entity/Q5659553 | 1972-01-01 | Paper |
https://portal.mardi4nfdi.de/entity/Q5668504 | 1972-01-01 | Paper |
Cospectral Graphs and Digraphs | 1971-01-01 | Paper |
Coloured Graphs: A Correction and Extension | 1970-01-01 | Paper |
The enumeration of tree-like polyhexes | 1970-01-01 | Paper |
https://portal.mardi4nfdi.de/entity/Q5607112 | 1970-01-01 | Paper |
Some Unusual Enumeration Problems | 1970-01-01 | Paper |
https://portal.mardi4nfdi.de/entity/Q5659552 | 1970-01-01 | Paper |
https://portal.mardi4nfdi.de/entity/Q5588439 | 1969-01-01 | Paper |
The Use of S-Functions in Combinatorial Analysis | 1968-01-01 | Paper |
An introduction to chromatic polynomials | 1967-01-01 | Paper |
https://portal.mardi4nfdi.de/entity/Q5603845 | 1967-01-01 | Paper |
A Type of "Gambler's Ruin" Problem | 1966-01-01 | Paper |
On the Number of Self-Complementary Graphs and Digraphs | 1963-01-01 | Paper |
Contributions to the Cell Growth Problem | 1962-01-01 | Paper |
Euler Graphs on Labelled Nodes | 1962-01-01 | Paper |
Card-Guessing with Information--A Problem in Probability | 1962-01-01 | Paper |
A note on the number of functional digraphs | 1961-01-01 | Paper |
Production Functions with Restricted Input Shares | 1961-01-01 | Paper |
The Number of k-Coloured Graphs on Labelled Nodes | 1960-01-01 | Paper |
The Enumeration of Locally Restricted Graphs (II) | 1960-01-01 | Paper |
The Enumeration of Locally Restricted Graphs (I) | 1959-01-01 | Paper |
Maximal Circuits in Critical Graphs | 1957-01-01 | Paper |