Identifiers
-
name variant
Daniel W. Cranston
0.60 · backfill
Papers (44)
-
Coloring, List Coloring, and Painting Squares of Graphs (and other related problems)
math.CO · 2022 · author #1
-
Proper Distinguishing Colorings with Few Colors for Graphs with Girth at Least 5
math.CO · 2017 · author #1
-
Acyclic edge-coloring of planar graphs: $\Delta$ colors suffice when $\Delta$ is large
math.CO · 2017 · author #1
-
Short fans and the 5/6 bound for line graphs
math.CO · 2016 · author #1
-
Planar Graphs have Independence Ratio at least 3/13
math.CO · 2016 · author #1
-
Beyond Degree Choosability
math.CO · 2015 · author #1
-
Modified Linear Programming and Class 0 Bounds for Graph Pebbling
math.CO · 2015 · author #1
-
List-coloring claw-free graphs with $\Delta$-1 colors
math.CO · 2015 · author #1
-
Edge-coloring via fixable subgraphs
math.CO · 2015 · author #1
-
Subcubic edge chromatic critical graphs have many edges
math.CO · 2015 · author #1
-
List-coloring the Squares of Planar Graphs without 4-Cycles and 5-Cycles
math.CO · 2015 · author #1
-
List-coloring the Square of a Subcubic Graph
math.CO · 2015 · author #1
-
The Fractional Chromatic Number of the Plane
math.CO · 2015 · author #1
-
A note on coloring vertex-transitive graphs
math.CO · 2014 · author #1
-
Brooks' Theorem and Beyond
math.CO · 2014 · author #1
-
Painting Squares in $\Delta^2-1$ Shades
math.CO · 2013 · author #1
-
Choice number of complete multipartite graphs $K_{3*3,2*(k-5),1*2}$ and $K_{4,3*2,2*(k-6),1*3}$
math.CO · 2013 · author #3
-
Multigraphs with $\Delta \ge 3$ are Totally-$(2\Delta-1)$-choosable
math.CO · 2013 · author #1
-
An Introduction to the Discharging Method via Graph Coloring
math.CO · 2013 · author #1
-
Graphs with $\chi=\Delta$ have big cliques
math.CO · 2013 · author #1
-
On the Boundedness of Positive Solutions of the Reciprocal Max-Type Difference Equation $x_{n}=\max\left\{\frac{A^{1}_{n-1}}{x_{n-1}}, \frac{A^{2}_{n-1}}{x_{n-2}}, \ldots, \frac{A^{t}_{n-1}}{x_{n-t}}\right\}$ with Periodic Parameters
math.DS · 2013 · author #1
-
Choosability of the square of a planar graph with maximum degree four
math.CO · 2013 · author #1
-
Sufficient sparseness conditions for G^2 to be (\Delta+1)-choosable, when \Delta\ge5
math.CO · 2013 · author #1
-
Regular graphs of odd degree are antimagic
math.CO · 2013 · author #1
-
1,2,3-Conjecture and 1,2-Conjecture for Sparse Graphs
math.CO · 2013 · author #1
-
Game matching number of graphs
math.CO · 2012 · author #1
-
Coloring claw-free graphs with \Delta-1 colors
math.CO · 2012 · author #1
-
Hamiltonicity in connected regular graphs
math.CO · 2012 · author #1
-
Coloring a graph with $\Delta-1$ colors: Conjectures equivalent to the Borodin-Kostochka conjecture that appear weaker
math.CO · 2012 · author #1
-
Revolutionaries and spies: Spy-good and spy-bad graphs
cs.DM · 2012 · author #2
-
Revolutionaries and spies on trees and unicyclic graphs
math.CO · 2011 · author #1
-
New results in $t$-tone coloring of graphs
math.CO · 2011 · author #1
-
Chain-making games in grid-like posets
math.CO · 2011 · author #1
-
List colorings of $K_5$-minor-free graphs with special list assignments
math.CO · 2011 · author #1
-
Linear Choosability of Sparse Graphs
math.CO · 2010 · author #1
-
Overlap Number of Graphs
math.CO · 2010 · author #1
-
Injective colorings of sparse graphs
math.CO · 2010 · author #1
-
Crossings, colorings, and cliques
math.CO · 2010 · author #2
-
A New Lower Bound on the Density of Vertex Identifying Codes for the Infinite Hexagonal Grid
math.CO · 2010 · author #1
-
Injective colorings of graphs with low average degree
math.CO · 2010 · author #1
-
Classes of 3-regular graphs that are (7, 2)-edge-choosable
math.CO · 2008 · author #1
-
Antimagic labelings of regular bipartite graphs: An application of the Marriage Theorem
math.CO · 2007 · author #1
-
Nomadic Decompositions of Bidirected Complete Graphs
math.CO · 2006 · author #1
-
Edge-choosability and total-choosability of planar graphs with no adjacent 3-cycles
math.CO · 2005 · author #1
Mentions
-
1506.04225
#1 · backfill · confidence 0.70
Daniel W. Cranston
-
1505.03197
#1 · backfill · confidence 0.70
Daniel W. Cranston
-
1503.00157
#1 · backfill · confidence 0.70
Daniel W. Cranston
-
1501.01647
#1 · backfill · confidence 0.70
Daniel W. Cranston
-
2210.05915
#1 · arxiv_oai · confidence 0.70
Daniel W. Cranston
-
1404.6550
#1 · backfill · confidence 0.70
Daniel W. Cranston
-
1403.0479
#1 · backfill · confidence 0.70
Daniel W. Cranston
-
1311.1251
#1 · backfill · confidence 0.70
Daniel W. Cranston
-
1308.3046
#3 · backfill · confidence 0.70
Daniel W. Cranston
-
1308.3038
#1 · backfill · confidence 0.70
Daniel W. Cranston
-
1306.4434
#1 · backfill · confidence 0.70
Daniel W. Cranston
-
1305.3526
#1 · backfill · confidence 0.70
Daniel W. Cranston
-
1303.6748
#1 · backfill · confidence 0.70
Daniel W. Cranston
-
1303.5156
#1 · backfill · confidence 0.70
Daniel W. Cranston
-
1303.5136
#1 · backfill · confidence 0.70
Daniel W. Cranston
-
1303.4850
#1 · backfill · confidence 0.70
Daniel W. Cranston
-
1303.3198
#1 · backfill · confidence 0.70
Daniel W. Cranston
-
1208.0085
#1 · backfill · confidence 0.70
Daniel W. Cranston
-
1206.1269
#1 · backfill · confidence 0.70
Daniel W. Cranston
-
1204.6457
#1 · backfill · confidence 0.70
Daniel W. Cranston
-
1203.5380
#1 · backfill · confidence 0.70
Daniel W. Cranston
-
1202.2910
#2 · backfill · confidence 0.70
Daniel W. Cranston
-
1110.2274
#1 · backfill · confidence 0.70
Daniel W. Cranston
-
1108.4751
#1 · backfill · confidence 0.70
Daniel W. Cranston
-
1108.0710
#1 · backfill · confidence 0.70
Daniel W. Cranston
-
1105.2532
#1 · backfill · confidence 0.70
Daniel W. Cranston
-
1007.1615
#1 · backfill · confidence 0.70
Daniel W. Cranston
-
1007.0804
#1 · backfill · confidence 0.70
Daniel W. Cranston
-
1007.0786
#1 · backfill · confidence 0.70
Daniel W. Cranston
-
1006.3783
#2 · backfill · confidence 0.70
Daniel W. Cranston
-
1006.3779
#1 · backfill · confidence 0.70
Daniel W. Cranston
-
1006.3776
#1 · backfill · confidence 0.70
Daniel W. Cranston
-
0806.1348
#1 · backfill · confidence 0.70
Daniel W. Cranston
-
0708.2776
#1 · backfill · confidence 0.70
Daniel W. Cranston