Kevin G. Milans

Orcid: 0000-0002-9680-8949

Affiliations:
  • West Virginia University, Morgantown, WV, USA


According to our database1, Kevin G. Milans authored at least 24 papers between 2006 and 2023.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of two.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2023
Non-Empty Intersection of Longest Paths in $H$-Free Graphs.
Electron. J. Comb., 2023

2022
Systems of Overlap Representation for Families of Intervals.
Graphs Comb., 2022

2021
Sublinear Longest Path Transversals.
SIAM J. Discret. Math., 2021

2020
A Dichotomy Theorem for First-Fit Chain Partitions.
SIAM J. Discret. Math., 2020

Online Coloring a Token Graph.
Graphs Comb., 2020

Sublinear Longest Path Transversals and Gallai Families.
CoRR, 2020

2019
Graph 2-rankings.
Graphs Comb., 2019

2016
Tree-width and dimension.
Comb., 2016

2015
Set families with forbidden subposets.
J. Comb. Theory, Ser. A, 2015

Boolean algebras and Lubell functions.
J. Comb. Theory, Ser. A, 2015

2014
Linear Discrepancy of Chain Products and Posets with Bounded Degree.
Order, 2014

Degree Ramsey Numbers of Closed Blowups of Trees.
Electron. J. Comb., 2014

2013
Degree Ramsey numbers for cycles and blowups of trees.
Eur. J. Comb., 2013

2012
Saturation numbers for families of graph subdivisions.
J. Graph Theory, 2012

Overlap number of graphs.
J. Graph Theory, 2012

Cycle spectra of Hamiltonian graphs.
J. Comb. Theory, Ser. B, 2012

Degree Ramsey Numbers of Graphs.
Comb. Probab. Comput., 2012

2011
First-Fit is Linear on Posets Excluding Two Long Incomparable Chains.
Order, 2011

Acyclic Sets in <i>k</i>-Majority Tournaments.
Electron. J. Comb., 2011

On-line Ramsey Theory for Bounded Degree Graphs.
Electron. J. Comb., 2011

Binary subtrees with few labeled paths.
Comb., 2011

2008
Pebbling and optimal pebbling in graphs.
J. Graph Theory, 2008

Optimal strong parity edge-coloring of complete graphs.
Comb., 2008

2006
The Complexity of Graph Pebbling.
SIAM J. Discret. Math., 2006


  Loading...