Kevin G. Milans

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

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

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

On csauthors.net:

Bibliography

2019
Graph 2-rankings.
Graphs and Combinatorics, 2019

2016
Tree-width and dimension.
Combinatorica, 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.
Electr. 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.
Journal of Graph Theory, 2012

Overlap number of graphs.
Journal of Graph Theory, 2012

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

Degree Ramsey Numbers of Graphs.
Combinatorics, Probability & Computing, 2012

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

Acyclic Sets in k-Majority Tournaments.
Electr. J. Comb., 2011

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

Binary subtrees with few labeled paths.
Combinatorica, 2011

2008
Pebbling and optimal pebbling in graphs.
Journal of Graph Theory, 2008

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

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


  Loading...