Allen J. Schwenk

According to our database1, Allen J. Schwenk authored at least 19 papers between 1973 and 2019.

Collaborative distances:
  • Dijkstra number2 of five.
  • Erdős number3 of one.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

On csauthors.net:

Bibliography

2019
Minimum edge cuts in diameter 2 graphs.
Discussiones Mathematicae Graph Theory, 2019

2005
Efficient dominating sets in labeled rooted oriented trees.
Discrete Mathematics, 2005

2000
What is the Correct Way to Seed a Knockout Tournament?
The American Mathematical Monthly, 2000

1994
The Color-Degree Matrix and the Number of Multicolored Trees in Star Decompositions.
J. Comb. Theory, Ser. B, 1994

1991
Reconstruction of sequences.
Discrete Mathematics, 1991

1989
A Matter of Degree.
SIAM J. Discrete Math., 1989

Tight bounds on the chromatic sum of a connected graph.
Journal of Graph Theory, 1989

Enumeration of Hamiltonian cycles in certain generalized Petersen graphs.
J. Comb. Theory, Ser. B, 1989

An Introduction to Chromatic Sums.
Proceedings of the Computer Trends in the 1990s, 1989

1981
Pseudosimilar vertices in a graph.
Journal of Graph Theory, 1981

On unimodal sequences of graphical invariants.
J. Comb. Theory, Ser. B, 1981

1979
On the number of trees in a random forest.
J. Comb. Theory, Ser. B, 1979

1978
Generalized ramsey theory for graphs VII: Ramsey numbers for multigraphs and networks.
Networks, 1978

1977
The number of self-complementary achiral necklaces.
Journal of Graph Theory, 1977

Enumeration of graphs with signed points and lines.
Journal of Graph Theory, 1977

An asymptotic evaluation of the cycle index of a symmetric group.
Discrete Mathematics, 1977

1976
On Tactical Configurations with No Four-Cycles.
J. Comb. Theory, Ser. A, 1976

1975
The distribution of degrees in a large random tree.
Discrete Mathematics, 1975

1973
The number of caterpillars.
Discrete Mathematics, 1973


  Loading...