- J. A. Long Jr., K. G. Milans, M. Wigal, Longest Path and Cycle Transversals in Chordal Graphs, in preparation. (slides)
- R. C. Devine, K. G. Milans, Tight paths in fully directed hypergraphs, in preparation. (slides).
- J. Bright, J. Porter, and K. G. Milans, Turán Numbers of Ordered Tight Hyperpaths, submitted. (slides)
- J. A. Long Jr., K. G. Milans, A. Munaro, Non-empty intersection of longest paths in H-free graphs,
*Electron. J. of Comb.*, Vol 30 Issue 1, P1.32. (slides) - A. S. Jobson, A. E. Kézdy, K. G. Milans, D. B. West, D. J. Wildstrom, Systems of Overlap Representation for Families of Intervals,
*Graphs Combin*38, 36 (2022). - J. A. Long Jr., K. G. Milans, A. Munaro, Sublinear Longest Path Transversals,
*SIAM J. Discret. Math*, 35(3), (2021), 1673--1677. (slides) - K. G. Milans, M. C. Wigal, A dichotomy theorem for First-Fit on posets with forbidden subposets,
*SIAM J. Discret. Math*, 34(1) (2020), 586-596. (slides) - K. G. Milans, M. C. Wigal, Online coloring a token graph,
*Graphs Combin*, 36 (2020), 153-165. (slides) -
J. Almeter, S. Demircan, A. Kallmeyer, K. G. Milans, R. Winslow, The \(2\)-Ranking Numbers of Graphs,
*Graphs Combin*, 35 (2019), no. 1, 91-102. (From the 2015 Research Experience for Undergraduate Students at West Virginia University.) (slides) -
K. G. Milans, Monotone paths in dense edge-ordered graphs,
*J. Comb.*8 (2017), no. 3, honoring Ron Graham's 80 birthday. (slides) -
L. Lu and K. G. Milans, Set families with forbidden subposets.
*J. Combin. Th. Ser. A*, 136 (2015), 126--142.(slides) -
T. Johnston, L. Lu, and K. G. Milans, Boolean algebras and Lubell
functions.
*J. Combin. Th. Ser. A*, 136 (2015), 174--183. (slides) -
K. G. Milans, D. Stolee, and D. B. West, Ordered Ramsey Theory and
Track Representations of Graphs.
*J. Comb.*6 (2015), no. 4, 445--456. -
G. Joret, P. Micek, K. G. Milans, W. T. Trotter, B. Walczak, and R.
Wang, Tree-width and dimension.
*Combinatorica*, doi: 10.1007/s00493-014-3081-8. -
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), 291--305. -
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 399--414. Springer, 2013. (slides) -
D. W. Cranston, W. B. Kinnersley, K. G. Milans, G. J. Puleo, and D.
B. West, Chain-making games in grid-like posets.
*Journal of Combinatorics*, 3 (2012), 633--649. -
T. Jiang, K. G. Milans, and D. B. West, Degree Ramsey numbers for
cycles and blowups of trees.
*European J. Combin.*, 34 (2013), 414-423. -
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), 869-874. (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), 416-434. -
W. B. Kinnersley, K. G. Milans, and D. B. West, Degree Ramsey numbers
of graphs.
*Combin. Probab. Comput.*21 (2012), 229-253. Richard Schelp memorial issue. -
R. Downey, N. Greenberg, C. Jockusch, and K. G. Milans, Binary subtrees
with few labeled paths.
*Combinatorica*31 (2011), 285-303. (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 degree-Ramsey 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, First-Fit is Linear on Posets Excluding
Two Long Incomparable Chains.
*Order*28 (2011), 455-464. (slides) -
D. P. Bunde, K. G. Milans, D. B. West, and H. Wu, Optimal strong parity edge-coloring of complete graphs.
*Combinatorica*28 (2008), 625-632. (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), 215-238. -
D. P. Bunde, K. G. Milans, D. B. West, and H. Wu, Parity and strong parity edge-colorings of graphs.
*Congressus Numer*. 187 (2007), 193-213. -
K. G. Milans and B. Clark, The Complexity of Graph Pebbling.
*SIAM J. Discret. Math.*20(3) (2006), 769-798. (slides)

milans@math.wvu.edu