
J. Almeter, S. Demircan, A. Kallmeyer, K. G. Milans, R. Winslow, The \(2\)Ranking Numbers of Graphs,
submitted. (From the 2015 Research Experience for Undergraduate Students at West Virginia University.)

K. G. Milans, Monotone paths in dense edgeordered graphs, J. Comb., to appear. (slides)

L. Lu and K. G. Milans, Set families with forbidden subposets.
J. Combin. Th. Ser. A, 136 (2015), 126142.(slides)

T. Johnston, L. Lu, and K. G. Milans, Boolean algebras and Lubell
functions. J. Combin. Th. Ser. A, 136 (2015), 174183. (slides)

K. G. Milans, D. Stolee, and D. B. West, Ordered Ramsey Theory and
Track Representations of Graphs. J. Comb. 6 (2015), no. 4,
445456.

G. Joret, P. Micek, K. G. Milans, W. T. Trotter, B. Walczak, and R.
Wang, Treewidth and dimension. Combinatorica, doi: 10.1007/s0049301430818.

P. Horn, K. G. Milans, and V. Rödl, Degree Ramsey numbers of closed
blowups of trees. Electronic Journal of Combinatorics 21 (2014),
Paper 2.5.

J. Choi, K. G. Milans, and D. B. West, Linear Discrepancy of Chain
Products and Posets with Bounded Degree. Order, 31(3) (2014),
291305.

A. V. Kostochka and K. G. Milans, Coloring clean and \(K_{4}\)free circle graphs. In János Pach, editor, Thirty Essays in Geometric
Graph Theory, pages 399414. Springer, 2013. (slides)

D. W. Cranston, W. B. Kinnersley, K. G. Milans, G. J. Puleo, and D.
B. West, Chainmaking games in gridlike posets. Journal of
Combinatorics, 3 (2012), 633649.

T. Jiang, K. G. Milans, and D. B. West, Degree Ramsey numbers for
cycles and blowups of trees. European J. Combin., 34 (2013),
414423.

F. Pfender, K. G. Milans, D. Rautenbach, F. Regen, and D. B. West,
Cycle spectra of Hamiltonian graphs. J. Combin. Th. Ser. B,
102 (2012), 869874. (slides)

M. Ferrara, M. S. Jacobson, K. G. Milans, C. Tennenhouse, and P. S.
Wenger, Saturation numbers for graph subdivision families. J.
Graph Theory, 71 (2012), 416434.

W. B. Kinnersley, K. G. Milans, and D. B. West, Degree Ramsey numbers
of graphs. Combin. Probab. Comput. 21 (2012), 229253. Richard
Schelp memorial issue.

R. Downey, N. Greenberg, C. Jockusch, and K. G. Milans, Binary subtrees
with few labeled paths. Combinatorica 31 (2011), 285303. (slides)

K. G. Milans, D. Schreiber, and D. B. West, Acyclic sets in \(k\)majority
tournaments. Electronic Journal of Combinatorics 18 (2011),
Paper 122.

J. Butterfield, T. Grauman, W. B. Kinnersley, K. G. Milans, C. Stocker,
and D. B. West, Online degreeRamsey theory. Electronic Journal
of Combinatorics 18 (2011), Paper 136. (slides)

D. W. Cranston, N. Korula, T. LeSaulnier, K. G. Milans, C. Stocker,
and J. Vandenbussche, Overlap number of graphs. J. Graph Theory,
doi: 10.1002/jgt.20596.

G. Joret and K. G. Milans, FirstFit is Linear on Posets Excluding
Two Long Incomparable Chains. Order 28 (2011), 455464. (slides)

D. P. Bunde, K. G. Milans, D. B. West, and H. Wu, Optimal strong parity edgecoloring of complete graphs. Combinatorica 28 (2008),
625632. (slides)

D. P. Bunde, E. W. Chambers, D. Cranston, K. G. Milans, and D. B.
West, Pebbling and optimal pebbling in graphs. J. Graph Theory
57 (2008), 215238.

D. P. Bunde, K. G. Milans, D. B. West, and H. Wu, Parity and strong parity edgecolorings of graphs. Congressus Numer. 187 (2007),
193213.

K. G. Milans and B. Clark, The Complexity of Graph Pebbling. SIAM J. Discret. Math. 20(3) (2006), 769798. (slides)
milans@math.wvu.edu