122 results on '"Cranston, Daniel W."'
Search Results
2. Bounding clique size in squares of planar graphs
3. Odd-sum colorings of planar graphs
4. Optimally reconfiguring list and correspondence colourings
5. Kempe equivalent list edge-colorings of planar graphs
6. A note on odd colorings of 1-planar graphs
7. On asymptotic packing of geometric graphs
8. List-recoloring of sparse graphs
9. In most 6-regular toroidal graphs all 5-colorings are Kempe equivalent
10. Cliques in squares of graphs with maximum average degree less than 4.
11. 5‐Coloring reconfiguration of planar graphs with no short odd cycles.
12. Degeneracy and Colorings of Squares of Planar Graphs without 4-Cycles
13. Planar graphs of girth at least five are square (Δ + 2)-choosable
14. Planar graphs are 9/2-colorable
15. Edge Lower Bounds for List Critical Graphs, Via Discharging
16. Cliques in Squares of Graphs with Maximum Average Degree less than 4
17. The $t$-Tone Chromatic Number of Classes of Sparse Graphs
18. Coloring a graph with [formula omitted] colors: Conjectures equivalent to the Borodin–Kostochka conjecture that appear weaker
19. Modified linear programming and class 0 bounds for graph pebbling
20. Proper Conflict-free Coloring of Graphs with Large Maximum Degree
21. Coloring, List Coloring, and Painting Squares of Graphs (and other related problems)
22. The fractional chromatic number of the plane
23. 5-Coloring Reconfiguration of Planar Graphs with No Short Odd Cycles
24. The 1 , 2 , 3-Conjecture And 1 , 2-Conjecture For Sparse Graphs
25. Sufficient sparseness conditions for [formula omitted] to be [formula omitted]-choosable, when [formula omitted]
26. Strong edge-coloring of cubic bipartite graphs: A counterexample
27. On the boundedness of positive solutions of the reciprocal max-type difference equation [formula omitted] with periodic parameters
28. Game matching number of graphs
29. Optimally Reconfiguring List and Correspondence Colourings
30. Odd Colorings of Sparse Graphs
31. Revolutionaries and spies: Spy-good and spy-bad graphs
32. Coloring (P5,gem) $({P}_{5},\text{gem})$‐free graphs with Δ−1 ${\rm{\Delta }}-1$ colors.
33. Planar Tur\'{a}n Numbers of Cycles: A Counterexample
34. Linear choosability of sparse graphs
35. Injective colorings of sparse graphs
36. Injective Colorings of Graphs with Low Average Degree
37. Multigraphs with Δ ≥ 3 are Totally-(2Δ−1)-Choosable
38. Coloring $(P_5, \text{gem})$-free graphs with $\Delta -1$ colors
39. Planar graphs of girth at least five are square (\(Δ\)\unicode8239+\unicode82392)-choosable
40. VERTEX PARTITIONS INTO AN INDEPENDENT SET AND A FOREST WITH EACH COMPONENT SMALL.
41. A Note on Bootstrap Percolation Thresholds in Plane Tilings using Regular Polygons
42. SPARSE GRAPHS ARE NEAR-BIPARTITE.
43. CIRCULAR FLOWS IN PLANAR GRAPHS.
44. A characterization of (4,2)‐choosable graphs.
45. Planar Graphs of Girth at least Five are Square $(\Delta + 2)$-Choosable
46. Edge-coloring via fixable subgraphs
47. Subcubic edge chromatic critical graphs have many edges
48. List-coloring the Squares of Planar Graphs without 4-Cycles and 5-Cycles
49. THE HILTON{ZHAO CONJECTURE IS TRUE FOR GRAPHS WITH MAXIMUM DEGREE 4.
50. ACYCLIC EDGE-COLORING OF PLANAR GRAPHS: Δ COLORS SUFFICE WHEN δ IS LARGE.
Catalog
Books, media, physical & digital resources
Discovery Service for Jio Institute Digital Library
For full access to our library's resources, please sign in.