Publication | Date of Publication | Type |
---|
https://portal.mardi4nfdi.de/entity/Q3113188 | 2012-02-08 | Paper |
Counting labeled general cubic graphs | 2007-11-30 | Paper |
https://portal.mardi4nfdi.de/entity/Q4405757 | 2004-01-07 | Paper |
The asymptotic number of claw-free cubic graphs. | 2003-12-04 | Paper |
https://portal.mardi4nfdi.de/entity/Q4780500 | 2003-06-13 | Paper |
Counting Claw-Free Cubic Graphs | 2003-01-05 | Paper |
On the spanning tree packing number of a graph: A survey | 2001-04-24 | Paper |
The hidden algorithm of Ore's theorem on Hamiltonian cycles | 1998-12-02 | Paper |
https://portal.mardi4nfdi.de/entity/Q4393237 | 1998-11-17 | Paper |
A tribute to Frank Harary (in honor of his 70th birthday) | 1998-09-15 | Paper |
Hitting time for \(k\) edge-disjoint spanning trees in a random graph | 1996-09-29 | Paper |
https://portal.mardi4nfdi.de/entity/Q4873767 | 1996-04-22 | Paper |
https://portal.mardi4nfdi.de/entity/Q4873679 | 1996-04-17 | Paper |
https://portal.mardi4nfdi.de/entity/Q4871048 | 1996-03-28 | Paper |
https://portal.mardi4nfdi.de/entity/Q4304427 | 1994-09-12 | Paper |
https://portal.mardi4nfdi.de/entity/Q3139774 | 1994-05-15 | Paper |
Balancing the \(n\)-cube: A census of colorings | 1994-02-02 | Paper |
Matchings in random superpositions of bipartite trees | 1992-10-26 | Paper |
Matchings and cycle covers in random digraphs | 1992-06-28 | Paper |
Asymptotic number of symmetries in locally restricted trees | 1992-06-25 | Paper |
https://portal.mardi4nfdi.de/entity/Q3491610 | 1990-01-01 | Paper |
https://portal.mardi4nfdi.de/entity/Q3834080 | 1988-01-01 | Paper |
https://portal.mardi4nfdi.de/entity/Q3812283 | 1987-01-01 | Paper |
https://portal.mardi4nfdi.de/entity/Q3680834 | 1985-01-01 | Paper |
https://portal.mardi4nfdi.de/entity/Q3682512 | 1985-01-01 | Paper |
Enumeration of self-dual configurations | 1984-01-01 | Paper |
Redfield's lost paper in a modern context | 1984-01-01 | Paper |
Points by degree and orbit size in chemical trees. II | 1983-01-01 | Paper |
Local connectivity of a random graph | 1983-01-01 | Paper |
https://portal.mardi4nfdi.de/entity/Q3936764 | 1981-01-01 | Paper |
On the number of trees in a random forest | 1979-01-01 | Paper |
The probability that a point of a tree is fixed | 1979-01-01 | Paper |
https://portal.mardi4nfdi.de/entity/Q3877715 | 1978-01-01 | Paper |
https://portal.mardi4nfdi.de/entity/Q4141278 | 1977-01-01 | Paper |
Enumeration of graphs with signed points and lines | 1977-01-01 | Paper |
The number of self-complementary achiral necklaces | 1977-01-01 | Paper |
On the cell-growth problem for arbitrary polygons | 1975-01-01 | Paper |
Arrangements of point charges having zero electric-field gradient | 1975-01-01 | Paper |
Arrangements of point charges having zero electric-field gradient: addendum and corrigenda | 1975-01-01 | Paper |
On the number of phenotype structures in genetic systems | 1974-01-01 | Paper |
Efficiency of a Binary Comparison Storage Technique | 1974-01-01 | Paper |
Enumeration under two representations of the wreath product | 1973-01-01 | Paper |
On the number of \(n\)-plexes | 1973-01-01 | Paper |
https://portal.mardi4nfdi.de/entity/Q4404932 | 1973-01-01 | Paper |
https://portal.mardi4nfdi.de/entity/Q5672667 | 1973-01-01 | Paper |
On the Number of Plane 2-Trees | 1973-01-01 | Paper |
https://portal.mardi4nfdi.de/entity/Q5682013 | 1973-01-01 | Paper |
https://portal.mardi4nfdi.de/entity/Q5682346 | 1973-01-01 | Paper |
Correction: “The smallest graph whose group is cyclic” | 1972-01-01 | Paper |
https://portal.mardi4nfdi.de/entity/Q5659581 | 1972-01-01 | Paper |
Asymptotic formulas for the number of self‐complementary graphs and digraphs | 1970-01-01 | Paper |
On the number of labeled 2-trees | 1969-01-01 | Paper |
Combinatorial Problems in Set-Theoretic Form | 1969-01-01 | Paper |
https://portal.mardi4nfdi.de/entity/Q5575350 | 1969-01-01 | Paper |
https://portal.mardi4nfdi.de/entity/Q5582909 | 1969-01-01 | Paper |
https://portal.mardi4nfdi.de/entity/Q5588440 | 1969-01-01 | Paper |
On acyclic simplicial complexes | 1968-01-01 | Paper |
On the point-group and line-group of a graph | 1968-01-01 | Paper |
https://portal.mardi4nfdi.de/entity/Q5560177 | 1968-01-01 | Paper |
On the problem of reconstructing a tournament from subtournaments | 1967-01-01 | Paper |
The matrix group of two permutation groups | 1967-01-01 | Paper |
Which Graphs have only Self-Converse Orientations? | 1967-01-01 | Paper |
On the number of balanced signed graphs | 1967-01-01 | Paper |
The Enumeration Methods of Redfield | 1967-01-01 | Paper |
https://portal.mardi4nfdi.de/entity/Q5508787 | 1966-01-01 | Paper |
The smallest graph whose group is cyclic | 1966-01-01 | Paper |
The Reconstruction of a Tree from its Maximal Subtrees | 1966-01-01 | Paper |
https://portal.mardi4nfdi.de/entity/Q5516079 | 1966-01-01 | Paper |
The power group enumeration theorem | 1966-01-01 | Paper |
Enumeration of Mixed Graphs | 1966-01-01 | Paper |
Enumeration of Locally Restricted Digraphs | 1966-01-01 | Paper |
Enumeration of self‐converse digraphs | 1966-01-01 | Paper |
https://portal.mardi4nfdi.de/entity/Q5516078 | 1965-01-01 | Paper |
THE POWER GROUP OF TWO PERMUTATION GROUPS | 1965-01-01 | Paper |