#### Filter Results:

- Full text PDF available (8)

#### Publication Year

2006

2015

- This year (0)
- Last 5 years (4)
- Last 10 years (12)

#### Publication Type

#### Co-author

#### Journals and Conferences

Learn More

- Alexandr V. Kostochka, Noah Prince
- Discrete Mathematics
- 2008

Let D(H) be the minimum d such that every graph G with average degree d has an H-minor. Myers and Thomason found good bounds onD(H) for almost all graphsH and proved that for â€˜balancedâ€™H randomâ€¦ (More)

- JÃ³zsef Balogh, Alexandr V. Kostochka, Noah Prince, Michael Stiebitz
- Discrete Mathematics
- 2009

ErdÅ‘s and LovÃ¡sz conjectured in 1968 that for every graph G with Ï‡(G) > Ï‰(G) and any two integers s, t â‰¥ 2 with s + t = Ï‡(G) + 1, there is a partition (S, T ) of the vertex set V (G) such thatâ€¦ (More)

- Erin W. Chambers, Bill Kinnersley, Noah Prince, Douglas B. West
- SIAM J. Discrete Math.
- 2009

A Roman dominating function of a graph G is a labeling f : V (G) â†’ {0, 1, 2} such that every vertex with label 0 has a neighbor with label 2. The Roman domination number Î³R(G) of G is the minimum ofâ€¦ (More)

- Alexandr V. Kostochka, Noah Prince
- Discrete Mathematics
- 2010

Let K âˆ— 3,t denote the graph obtained from K3,t by adding all edges between the three vertices of degree t in it. We prove that for each t â‰¥ 6300 and n â‰¥ t + 3, each n-vertex graph G with e(G) > 1 2â€¦ (More)

- Alexandr V. Kostochka, Noah Prince
- Discrete Mathematics
- 2012

Let Kâˆ— s,t denote the graph obtained from Ks,t by adding all edges between the s vertices of degree t in it. We show how to adapt the argument of an our previous paper (Discrete Math. 308 (2008),â€¦ (More)

- Henry Liu, Robert Morris, Noah Prince
- Discrete Mathematics
- 2008

Suppose the edges of the complete graph on n vertices, E(Kn), are coloured using r colours; how large a k-connected subgraph are we guaranteed to find, which uses only at most s of the colours? Thisâ€¦ (More)

- Henry Liu, Robert Morris, Noah Prince
- Journal of Graph Theory
- 2009

We consider the following question of BollobÃ¡s: given an r-colouring of E(Kn), how large a k-connected subgraph can we find using at most s colours? We provide a partial solution to this problem whenâ€¦ (More)

- Noah Prince, Spiros Blackburn, +5 authors Dhruv Singhal
- Annals of plastic surgery
- 2015

BACKGROUND
When composite scalp and calvarial defects with dural or cortical brain exposure are encountered, active infection or indeterminate oncologic margins complicate the timing of scalpâ€¦ (More)

- Timothy D. LeSaulnier, Noah Prince, Paul S. Wenger, Douglas B. West, Pratik Worah
- SIAM J. Discrete Math.
- 2013

Let G be a weighted graph in which each vertex initially has weight 1. A total acquisition move transfers all the weight from a vertex u to a neighboring vertex v, under the condition that before theâ€¦ (More)

- JÃ³zsef Balogh, Noah Prince
- Graphs and Combinatorics
- 2009

Define a k-minimum-difference-representation (k-MDR) of a graph G to be a family of sets {S(v) : v âˆˆ V (G)} such that u and v are adjacent in G if and only if min{|S(u)âˆ’ S(v)|, |S(v)âˆ’ S(u)|} â‰¥ k.â€¦ (More)