7.9k citations
- University of Illinois Urbana-ChampaignUS495 papers
- Argonne National LaboratoryUS297 papers
- University of MichiganUS290 papers
- Istituto Nazionale di Fisica Nucleare, Laboratori Nazionali di FrascatiIT283 papers
- University of GlasgowGB279 papers
- Lawrence Berkeley National LaboratoryUS271 papers
- University of ChicagoUS270 papers
- Michigan State UniversityUS263 papers
- The Ohio State UniversityUS262 papers
- Duke UniversityUS261 papers
- University of LiverpoolGB261 papers
- University of PittsburghUS260 papers
Showing 2013 · math.COShow all
2 papers · 2 filters
math.CO2013★ 8 cited
On choosability with separation of planar graphs with lists of different sizes
Hal Kierstead, Bernard Lidický
A (k,d)-list assignment L of a graph G is a mapping that assigns to each vertex v a list L(v) of at least k colors and for any adjacent pair xy, the lists L(x) and L(y) share at mo…
math.CO2013
1,2,3-Conjecture and 1,2-Conjecture for Sparse Graphs
Daniel W. Cranston, Sogol Jahanbekam, Douglas B. West
We apply the Discharging Method to prove the 1,2,3-Conjecture and the 1,2-Conjecture for graphs with maximum average degree less than 8/3. Stronger results on these conjectures hav…