Notice: Unexpected clearActionName after getActionName already called in /var/www/html/w/includes/context/RequestContext.php on line 333
Edgar M. Palmer - MaRDI portal

Edgar M. Palmer

From MaRDI portal
(Redirected from Person:175489)
Person:754227

Available identifiers

zbMath Open palmer.edgar-mMaRDI QIDQ754227

List of research outcomes





PublicationDate of PublicationType
https://portal.mardi4nfdi.de/entity/Q31131882012-02-08Paper
Counting labeled general cubic graphs2007-11-30Paper
https://portal.mardi4nfdi.de/entity/Q44057572004-01-07Paper
The asymptotic number of claw-free cubic graphs.2003-12-04Paper
https://portal.mardi4nfdi.de/entity/Q47805002003-06-13Paper
Counting Claw-Free Cubic Graphs2003-01-05Paper
On the spanning tree packing number of a graph: A survey2001-04-24Paper
The hidden algorithm of Ore's theorem on Hamiltonian cycles1998-12-02Paper
https://portal.mardi4nfdi.de/entity/Q43932371998-11-17Paper
A tribute to Frank Harary (in honor of his 70th birthday)1998-09-15Paper
Hitting time for \(k\) edge-disjoint spanning trees in a random graph1996-09-29Paper
https://portal.mardi4nfdi.de/entity/Q48737671996-04-22Paper
https://portal.mardi4nfdi.de/entity/Q48736791996-04-17Paper
https://portal.mardi4nfdi.de/entity/Q48710481996-03-28Paper
https://portal.mardi4nfdi.de/entity/Q43044271994-09-12Paper
https://portal.mardi4nfdi.de/entity/Q31397741994-05-15Paper
Balancing the \(n\)-cube: A census of colorings1994-02-02Paper
Matchings in random superpositions of bipartite trees1992-10-26Paper
Matchings and cycle covers in random digraphs1992-06-28Paper
Asymptotic number of symmetries in locally restricted trees1992-06-25Paper
https://portal.mardi4nfdi.de/entity/Q34916101990-01-01Paper
https://portal.mardi4nfdi.de/entity/Q38340801988-01-01Paper
https://portal.mardi4nfdi.de/entity/Q38122831987-01-01Paper
https://portal.mardi4nfdi.de/entity/Q36808341985-01-01Paper
https://portal.mardi4nfdi.de/entity/Q36825121985-01-01Paper
Enumeration of self-dual configurations1984-01-01Paper
Redfield's lost paper in a modern context1984-01-01Paper
Points by degree and orbit size in chemical trees. II1983-01-01Paper
Local connectivity of a random graph1983-01-01Paper
https://portal.mardi4nfdi.de/entity/Q39367641981-01-01Paper
On the number of trees in a random forest1979-01-01Paper
The probability that a point of a tree is fixed1979-01-01Paper
https://portal.mardi4nfdi.de/entity/Q38777151978-01-01Paper
https://portal.mardi4nfdi.de/entity/Q41412781977-01-01Paper
Enumeration of graphs with signed points and lines1977-01-01Paper
The number of self-complementary achiral necklaces1977-01-01Paper
On the cell-growth problem for arbitrary polygons1975-01-01Paper
Arrangements of point charges having zero electric-field gradient1975-01-01Paper
Arrangements of point charges having zero electric-field gradient: addendum and corrigenda1975-01-01Paper
On the number of phenotype structures in genetic systems1974-01-01Paper
Efficiency of a Binary Comparison Storage Technique1974-01-01Paper
Enumeration under two representations of the wreath product1973-01-01Paper
On the number of \(n\)-plexes1973-01-01Paper
https://portal.mardi4nfdi.de/entity/Q44049321973-01-01Paper
https://portal.mardi4nfdi.de/entity/Q56726671973-01-01Paper
On the Number of Plane 2-Trees1973-01-01Paper
https://portal.mardi4nfdi.de/entity/Q56820131973-01-01Paper
https://portal.mardi4nfdi.de/entity/Q56823461973-01-01Paper
Correction: “The smallest graph whose group is cyclic”1972-01-01Paper
https://portal.mardi4nfdi.de/entity/Q56595811972-01-01Paper
Asymptotic formulas for the number of self‐complementary graphs and digraphs1970-01-01Paper
On the number of labeled 2-trees1969-01-01Paper
Combinatorial Problems in Set-Theoretic Form1969-01-01Paper
https://portal.mardi4nfdi.de/entity/Q55753501969-01-01Paper
https://portal.mardi4nfdi.de/entity/Q55829091969-01-01Paper
https://portal.mardi4nfdi.de/entity/Q55884401969-01-01Paper
On acyclic simplicial complexes1968-01-01Paper
On the point-group and line-group of a graph1968-01-01Paper
https://portal.mardi4nfdi.de/entity/Q55601771968-01-01Paper
On the problem of reconstructing a tournament from subtournaments1967-01-01Paper
The matrix group of two permutation groups1967-01-01Paper
Which Graphs have only Self-Converse Orientations?1967-01-01Paper
On the number of balanced signed graphs1967-01-01Paper
The Enumeration Methods of Redfield1967-01-01Paper
https://portal.mardi4nfdi.de/entity/Q55087871966-01-01Paper
The smallest graph whose group is cyclic1966-01-01Paper
The Reconstruction of a Tree from its Maximal Subtrees1966-01-01Paper
https://portal.mardi4nfdi.de/entity/Q55160791966-01-01Paper
The power group enumeration theorem1966-01-01Paper
Enumeration of Mixed Graphs1966-01-01Paper
Enumeration of Locally Restricted Digraphs1966-01-01Paper
Enumeration of self‐converse digraphs1966-01-01Paper
https://portal.mardi4nfdi.de/entity/Q55160781965-01-01Paper
THE POWER GROUP OF TWO PERMUTATION GROUPS1965-01-01Paper

Research outcomes over time

This page was built for person: Edgar M. Palmer