The following pages link to Kerri Morgan (Q405175):
Displaying 22 items.
- Certificates for properties of stability polynomials of graphs (Q405176) (← links)
- Non-bipartite chromatic factors (Q409454) (← links)
- Algebraic properties of chromatic roots (Q510333) (← links)
- Pairs of chromatically equivalent graphs (Q659723) (← links)
- An infinite family of 2-connected graphs that have reliability factorisations (Q730493) (← links)
- (Q1634083) (redirect page) (← links)
- Finding happiness: an analysis of the maximum happy vertices problem (Q1634084) (← links)
- An algorithm which outputs a graph with a specified chromatic factor (Q1730229) (← links)
- Tackling the maximum happy vertices problem in large networks (Q2026712) (← links)
- The maximum happy induced subgraph problem: bounds and algorithms (Q2026981) (← links)
- Factorisation of greedoid polynomials of rooted digraphs (Q2053691) (← links)
- Further results on an abstract model for branching and its application to mixed integer programming (Q2235165) (← links)
- Certificates of factorisation for chromatic polynomials (Q2380229) (← links)
- Certificates of factorisation for a class of triangle-free graphs (Q2380230) (← links)
- Algebraic invariants arising from the chromatic polynomials of theta graphs (Q2876047) (← links)
- Galois groups of chromatic polynomials (Q5169640) (← links)
- Approximation Algorithms for the Maximum Induced Planar and Outerplanar Subgraph Problems (Q5301409) (← links)
- Short certificates for chromatic equivalence (Q5377353) (← links)
- (Q5869435) (← links)
- Mathematical foundations for measurement of communication efficiency in the human brain (Q6630473) (← links)
- Instance space analysis for the car sequencing problem (Q6638878) (← links)
- Graph polynomials: some questions on the edge (Q6733618) (← links)
