98 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. Coloring a graph with [formula omitted] colors: Conjectures equivalent to the Borodin–Kostochka conjecture that appear weaker
17. Modified linear programming and class 0 bounds for graph pebbling
18. The fractional chromatic number of the plane
19. The 1 , 2 , 3-Conjecture And 1 , 2-Conjecture For Sparse Graphs
20. Sufficient sparseness conditions for [formula omitted] to be [formula omitted]-choosable, when [formula omitted]
21. Strong edge-coloring of cubic bipartite graphs: A counterexample
22. On the boundedness of positive solutions of the reciprocal max-type difference equation [formula omitted] with periodic parameters
23. Game matching number of graphs
24. Revolutionaries and spies: Spy-good and spy-bad graphs
25. Coloring (P5,gem) $({P}_{5},\text{gem})$‐free graphs with Δ−1 ${\rm{\Delta }}-1$ colors.
26. Linear choosability of sparse graphs
27. Injective colorings of sparse graphs
28. Injective Colorings of Graphs with Low Average Degree
29. Multigraphs with Δ ≥ 3 are Totally-(2Δ−1)-Choosable
30. VERTEX PARTITIONS INTO AN INDEPENDENT SET AND A FOREST WITH EACH COMPONENT SMALL.
31. SPARSE GRAPHS ARE NEAR-BIPARTITE.
32. CIRCULAR FLOWS IN PLANAR GRAPHS.
33. A characterization of (4,2)‐choosable graphs.
34. THE HILTON{ZHAO CONJECTURE IS TRUE FOR GRAPHS WITH MAXIMUM DEGREE 4.
35. ACYCLIC EDGE-COLORING OF PLANAR GRAPHS: Δ COLORS SUFFICE WHEN δ IS LARGE.
36. Subcubic Edge-Chromatic Critical Graphs Have Many Edges.
37. SHORT FANS AND THE 5/6 BOUND FOR LINE GRAPHS.
38. List-Coloring the Squares of Planar Graphs without 4-Cycles and 5-Cycles.
39. LIST-COLORING CLAW-FREE GRAPHS WITH Δ - 1 COLORS.
40. An introduction to the discharging method via graph coloring.
41. Brooks' Theorem and Beyond.
42. GRAPHS WITH χ = Δ HAVE BIG CLIQUES.
43. Regular Graphs of Odd Degree Are Antimagic.
44. Choice number of complete multipartite graphs [formula omitted] and [formula omitted]
45. Nomadic decompositions of bidirected complete graphs
46. Short proofs for cut-and-paste sorting of permutations
47. Strong edge-coloring of graphs with maximum degree 4 using 22 colors
48. COLORING CLAW-FREE GRAPHS WITH Δ -- 1 COLORS.
49. List Colorings of K5-Minor-Free Graphs With Special List Assignments.
50. Overlap number of graphs.
Catalog
Books, media, physical & digital resources
Discovery Service for Jio Institute Digital Library
For full access to our library's resources, please sign in.