The following pages link to Jason I. Brown (Q343710):
Displayed 50 items.
- On the roots of all-terminal reliability polynomials (Q2400560) (← links)
- A note on the real part of complex chromatic roots (Q2449182) (← links)
- Bounding the roots of ideal and open set polynomials (Q2571017) (← links)
- The structure of well-covered graphs with no cycles of length 4 (Q2643318) (← links)
- On the unimodality of domination polynomials (Q2673493) (← links)
- (Q2716005) (← links)
- On the Roots of σ-Polynomials (Q2811197) (← links)
- (Q2843434) (← links)
- (Q2891252) (← links)
- (Q2929612) (← links)
- On the roots of strongly connected reliability polynomials (Q3057111) (← links)
- Parity Party with Picture Proofs: An Odd Checkerboard Problem (Q3103429) (← links)
- (Q3295614) (← links)
- (Q3351379) (← links)
- (Q3356319) (← links)
- On the Real Roots of Domination Polynomials (Q3391335) (← links)
- Uniformly optimal digraphs for strongly connected reliability (Q3428910) (← links)
- A note onKi-perfect graphs (Q3490043) (← links)
- Proof of a conjecture on fractional Ramsey numbers (Q3553231) (← links)
- (Q3624967) (← links)
- On generalized graph colorings (Q3748295) (← links)
- (Q3789615) (← links)
- A Set System Polynomial with Colouring and Reliability Applications (Q3792257) (← links)
- Roots of the Reliability Polynomials (Q4030196) (← links)
- ON UNIQUELY -G k-COLOURABLE GRAPHS (Q4034558) (← links)
- The inducibility of complete bipartite graphs (Q4309990) (← links)
- On the roots of the node reliability polynomial (Q4639686) (← links)
- Nonexistence of optimal graphs for all terminal reliability (Q4639690) (← links)
- Inflection points of reliability polynomials are dense in [0,1] (Q4642412) (← links)
- Asymptotics of a sequence of sparse binomial-type polynomials (Q4648897) (← links)
- The strongly connected reliability of complete digraphs (Q4680417) (← links)
- (Q4873670) (← links)
- The Ultimate Categorical Independence Ratio of a Graph (Q4881293) (← links)
- Cohen–Macaulay Rings in Network Reliability (Q4895629) (← links)
- (Q4909710) (← links)
- (Q4924918) (← links)
- Acyclic polynomials of graphs (Q5080911) (← links)
- On the imaginary parts of chromatic roots (Q5110657) (← links)
- A Construction of Uniquely C<sub>4</sub>-free colourable Graphs (Q5203050) (← links)
- Independence Equivalence Classes of Paths and Cycles (Q5206913) (← links)
- On the domination polynomials of friendship graphs (Q5279281) (← links)
- Network transformations and bounding network reliability (Q5285474) (← links)
- On the Roots of Expected Independence Polynomials (Q5325944) (← links)
- The Domination Equivalence Classes of Paths (Q5377030) (← links)
- (Q5409968) (← links)
- (Q5461524) (← links)
- Well-Covered Vector Spaces of Graphs (Q5470803) (← links)
- Extremal Restraints for Graph Colourings (Q5500320) (← links)
- (Q5503343) (← links)
- Network reliability (Q5890007) (← links)