Allen J. Schwenk

From MaRDI portal
Person:580370

Available identifiers

zbMath Open schwenk.allen-jWikidataQ102123545 ScholiaQ102123545MaRDI QIDQ580370

List of research outcomes

PublicationDate of PublicationType
Minimum edge cuts in diameter 2 graphs2019-02-07Paper
https://portal.mardi4nfdi.de/entity/Q57407932016-07-20Paper
https://portal.mardi4nfdi.de/entity/Q54883412006-09-14Paper
Efficient dominating sets in labeled rooted oriented trees2006-01-10Paper
The Steady State Sabbatical Rate2002-11-07Paper
Several Sets of n + 1 Shapes, Each the Similitude Union of the Other n2002-10-17Paper
Tiling Large Rectangles2002-01-01Paper
What is the Correct Way to Seed a Knockout Tournament?2001-11-26Paper
https://portal.mardi4nfdi.de/entity/Q49497842001-06-05Paper
https://portal.mardi4nfdi.de/entity/Q42084251999-04-09Paper
https://portal.mardi4nfdi.de/entity/Q48710411996-05-21Paper
https://portal.mardi4nfdi.de/entity/Q48736711996-04-17Paper
https://portal.mardi4nfdi.de/entity/Q48537461995-11-02Paper
Remarks on Problem B-3 on the 1990 William Lowell Putnam Mathematical Competition1994-10-24Paper
https://portal.mardi4nfdi.de/entity/Q43018721994-10-03Paper
The color-degree matrix and the number of multicolored trees in star decompositions1994-09-13Paper
https://portal.mardi4nfdi.de/entity/Q40299831993-04-01Paper
https://portal.mardi4nfdi.de/entity/Q40282761993-03-28Paper
Which Rectangular Chessboards Have a Knight's Tour?1992-09-27Paper
https://portal.mardi4nfdi.de/entity/Q39721331992-06-25Paper
https://portal.mardi4nfdi.de/entity/Q34832991990-01-01Paper
Enumeration of Hamiltonian cycles in certain generalized Petersen graphs1989-01-01Paper
A Matter of Degree1989-01-01Paper
Tight bounds on the chromatic sum of a connected graph1989-01-01Paper
https://portal.mardi4nfdi.de/entity/Q34746781988-01-01Paper
https://portal.mardi4nfdi.de/entity/Q38354981987-01-01Paper
Tight bounds on the spectral radius of asymmetric nonnegative matrices1986-01-01Paper
https://portal.mardi4nfdi.de/entity/Q37344221986-01-01Paper
https://portal.mardi4nfdi.de/entity/Q36825071985-01-01Paper
https://portal.mardi4nfdi.de/entity/Q36867201985-01-01Paper
https://portal.mardi4nfdi.de/entity/Q33442281984-01-01Paper
How Small Can the Mean Shadow of a Set Be?1983-01-01Paper
On unimodal sequences of graphical invariants1981-01-01Paper
Pseudosimilar vertices in a graph1981-01-01Paper
https://portal.mardi4nfdi.de/entity/Q39265971981-01-01Paper
On the number of trees in a random forest1979-01-01Paper
The spectral approach to determining the number of walks in a graph1979-01-01Paper
https://portal.mardi4nfdi.de/entity/Q38552071979-01-01Paper
https://portal.mardi4nfdi.de/entity/Q38645371979-01-01Paper
https://portal.mardi4nfdi.de/entity/Q39374411979-01-01Paper
https://portal.mardi4nfdi.de/entity/Q39505851979-01-01Paper
https://portal.mardi4nfdi.de/entity/Q39607311978-01-01Paper
https://portal.mardi4nfdi.de/entity/Q41545931978-01-01Paper
Generalized ramsey theory for graphs VII: Ramsey numbers for multigraphs and networks1978-01-01Paper
An asymptotic evaluation of the cycle index of a symmetric group1977-01-01Paper
Line minimal Boolean forests1977-01-01Paper
Enumeration of graphs with signed points and lines1977-01-01Paper
The number of self-complementary achiral necklaces1977-01-01Paper
On tactical configurations with no four-cycles1976-01-01Paper
https://portal.mardi4nfdi.de/entity/Q41001191976-01-01Paper
The distribution of degrees in a large random tree1975-01-01Paper
https://portal.mardi4nfdi.de/entity/Q40812751975-01-01Paper
https://portal.mardi4nfdi.de/entity/Q41057031975-01-01Paper
The communication problem on graphs1974-01-01Paper
https://portal.mardi4nfdi.de/entity/Q40609951974-01-01Paper
https://portal.mardi4nfdi.de/entity/Q40655811974-01-01Paper
The number of caterpillars1973-01-01Paper
On the number of unique subgraphs1973-01-01Paper
A Maximal Toroidal Graph which is not a Triangulation.1973-01-01Paper
https://portal.mardi4nfdi.de/entity/Q40837091973-01-01Paper
https://portal.mardi4nfdi.de/entity/Q47709781973-01-01Paper
https://portal.mardi4nfdi.de/entity/Q56762311973-01-01Paper
Graphs Suppressible to an Edge1972-01-01Paper
https://portal.mardi4nfdi.de/entity/Q56526921972-01-01Paper
https://portal.mardi4nfdi.de/entity/Q56706521972-01-01Paper
https://portal.mardi4nfdi.de/entity/Q56775081972-01-01Paper
https://portal.mardi4nfdi.de/entity/Q56820101972-01-01Paper
Acquaintance Graph Party Problem1972-01-01Paper
Trees with Hamiltonian square1971-01-01Paper
https://portal.mardi4nfdi.de/entity/Q56158421970-01-01Paper

Research outcomes over time


Doctoral students

No records found.


Known relations from the MaRDI Knowledge Graph

PropertyValue
MaRDI profile typeMaRDI person profile
instance ofhuman


This page was built for person: Allen J. Schwenk