According to our database1, Peter Hamburger authored at least 22 papers between 1992 and 2018.
Legend:Book In proceedings Article PhD thesis Other
Double Threshold Digraphs.
Proceedings of the 43rd International Symposium on Mathematical Foundations of Computer Science, 2018
Forcing Posets with Large Dimension to Contain Large Standard Examples.
Graphs and Combinatorics, 2016
Standard Examples as Subposets of Posets.
The Proof of the Removable Pair Conjecture for Fractional Dimension.
Electr. J. Comb., 2014
A Hypergraph Version of a Graph Packing Theorem by Bollobás and Eldridge.
Journal of Graph Theory, 2013
Destroying cycles in digraphs.
Kneser Representations of Graphs.
SIAM J. Discrete Math., 2009
On k-detour subgraphs of hypercubes.
Journal of Graph Theory, 2008
Solution of fink & straight conjecture on path-perfect complete bipartite graphs.
Journal of Graph Theory, 2007
Routing sets in the integer lattice.
Discrete Applied Mathematics, 2007
On Directed Triangles in Digraphs.
Electr. J. Comb., 2007
Edge Disjoint Paths of Increasing Order in Complete Bipartite Graphs.
Electronic Notes in Discrete Mathematics, 2005
A Symmetrical Beauty. A Non-simple 7-Venn Diagram With A Minimum Vertex Set.
Ars Comb., 2003
Doodles and doilies, non-simple symmetric Venn diagram.
Discrete Mathematics, 2002
Hypercube subgraphs with local detours.
Journal of Graph Theory, 1999
Regular Honest Graphs, Isoperimetric Numbers, and Bisection of Weighted Graphs.
Eur. J. Comb., 1999
Hypercube subgraphs with minimal detours.
Journal of Graph Theory, 1996
Hamilton Cycles in Planar Graphs and Venn Diagrams.
J. Comb. Theory, Ser. B, 1996
Random packing by rho-connected rho-regular graphs.
Discrete Mathematics, 1996
Random packings of graphs.
Discrete Mathematics, 1994
On a class of kernel-perfect and kernel-perfect-critical graphs.
Discrete Mathematics, 1993
On a leverage problem in the hypercube.