# Search results for: Andrew D. King

Weather and Climate Extremes > 2017 > 15 > C > 1-10

Journal of Graph Theory > 84 > 2 > 158 - 175

*strongly even‐cycle decomposable*if the edge set of every subdivision with an even number of edges can be partitioned into cycles of even length. We prove that several fundamental composition operations that preserve the property of being Eulerian also yield strongly even‐cycle decomposable graphs. As an easy application of our theorems, we give an exact characterization of the set of strongly...

Cell Reports > 2016 > 17 > 1 > 289-302

Climate Dynamics > 2016 > 46 > 1-2 > 413-426

Quantum Information Processing > 2016 > 15 > 1 > 495-508

*Chimera*graph $${\mathcal {C}}_{M,N,L}$$ C M , N , L . In order to solve an Ising spin problem with arbitrary pairwise interaction structure, the corresponding graph must be minor-embedded into a Chimera graph....

Journal of Graph Theory > 81 > 1 > 30 - 34

Journal of Graph Theory > 78 > 3 > 157 - 194

Climate Dynamics > 2015 > 44 > 9-10 > 2623-2635

Discrete Applied Mathematics > 2014 > 169 > Complete > 119-134

Discrete Applied Mathematics > 2013 > 161 > 16-17 > 2492-2498

International Journal of Climatology > 33 > 10 > 2376 - 2387

Journal of Graph Theory > 73 > 3 > 354 - 360

Journal of Graph Theory > 73 > 3 > 327 - 341

*G*, we have $\chi \left(G\right)\le (1+o\left(1\right)){\chi}_{f}\left(G\right)$. We extend this result to quasi‐line graphs, an important subclass of claw‐free graphs. Furthermore, we prove that we can construct a coloring that achieves this bound in polynomial time, giving us an asymptotic approximation algorithm...

Advances in Mathematics > 2011 > 227 > 4 > 1646-1664

Journal of Graph Theory > 67 > 4 > 300 - 305

Discrete Applied Mathematics > 2010 > 158 > 7 > 765-770

Electronic Notes in Discrete Mathematics > 2007 > 29 > Complete > 327-331