Peter Hamburger - researchr alias

researchr

You are not signed in
Sign in
Sign up

Viewing Publication 1 - 22 from 22

2018

Double Threshold DigraphsPeter Hamburger, Ross M. McConnell, Attila Pór, Jeremy P. Spinrad, Zhisheng Xu. mfcs 2018: [doi]

2016

Forcing Posets with Large Dimension to Contain Large Standard ExamplesCsaba Biró, Peter Hamburger, Attila Pór, William T. Trotter. gc, 32(3):861-880, 2016. [doi]

2015

Standard Examples as Subposets of PosetsCsaba Biró, Peter Hamburger, Attila Pór. order, 32(2):293-299, 2015. [doi]

2014

The Proof of the Removable Pair Conjecture for Fractional DimensionCsaba Biró, Peter Hamburger, Attila Pór. combinatorics, 21(1):1, 2014. [doi]

2013

A Hypergraph Version of a Graph Packing Theorem by Bollobás and EldridgeAlexandr V. Kostochka, Christopher Stocker, Peter Hamburger. jgt, 74(2):222-235, 2013. [doi]

2011

Destroying cycles in digraphsMolly Dunkum, Peter Hamburger, Attila Pór. combinatorica, 31(1):55-66, 2011. [doi]

2009

Kneser Representations of GraphsPeter Hamburger, Attila PÃ³r, Matt Walsh. siamdm, 23(2):1071-1081, 2009. [doi]

2008

On ::::k::::-detour subgraphs of hypercubesNana Arizumi, Peter Hamburger, Alexandr V. Kostochka. jgt, 57(1):55-64, 2008. [doi]

2007

Solution of fink & straight conjecture on path-perfect complete bipartite graphsWeiting Cao, Peter Hamburger. jgt, 55(2):91-111, 2007. [doi]

Routing sets in the integer latticePeter Hamburger, Robert C. Vandell, Matt Walsh. DAM, 155(11):1384-1394, 2007. [doi]

On Directed Triangles in DigraphsPeter Hamburger, Penny E. Haxell, Alexandr V. Kostochka. combinatorics, 14(1), 2007. [doi]

2005

Edge Disjoint Paths of Increasing Order in Complete Bipartite GraphsPeter Hamburger, Weiting Cao. endm, 22:61-67, 2005. [doi]

2003

A Symmetrical Beauty. A Non-simple 7-Venn Diagram With A Minimum Vertex SetPeter Hamburger, Raymond E. Pippert. arscom, 66, 2003.

2002

Doodles and doilies, non-simple symmetric Venn diagramPeter Hamburger. DM, 257(2-3):423-439, 2002. [doi]

1999

Regular Honest Graphs, Isoperimetric Numbers, and Bisection of Weighted GraphsNoga Alon, Peter Hamburger, Alexandr V. Kostochka. ejc, 20(6):469-481, 1999. [doi]

Hypercube subgraphs with local detoursPeter Hamburger, Alexandr V. Kostochka, Alexander Sidorenko. jgt, 30(2):101-111, 1999. [doi]

1996

Random packing by rho-connected rho-regular graphsLowell W. Beineke, Peter Hamburger, William D. Weakley. DM, 160(1-3):41-47, 1996. [doi]

Hamilton Cycles in Planar Graphs and Venn DiagramsKiran B. Chilakamarri, Peter Hamburger, Raymond E. Pippert. JCT, 67(2):296-303, 1996. [doi]

Hypercube subgraphs with minimal detoursPaul Erdös, Peter Hamburger, Raymond E. Pippert, William D. Weakley. jgt, 23(2):119-128, 1996. [doi]

1994

Random packings of graphsLowell W. Beineke, Peter Hamburger, Wayne Goddard. DM, 125(1-3):45-54, 1994. [doi]

1993

On a class of kernel-perfect and kernel-perfect-critical graphsKiran B. Chilakamarri, Peter Hamburger. DM, 118(1-3):253-257, 1993. [doi]

1992

On a leverage problem in the hypercubePeter Hamburger, Raymond E. Pippert, William Douglas Weakley. networks, 22(5):435-439, 1992. [doi]

Sign in or sign up to see more results.

runs on WebDSL