22 results on '"Cranston, Daniel W."'
Search Results
2. Odd-sum colorings of planar graphs
3. Optimally reconfiguring list and correspondence colourings
4. Kempe equivalent list edge-colorings of planar graphs
5. A note on odd colorings of 1-planar graphs
6. On asymptotic packing of geometric graphs
7. List-recoloring of sparse graphs
8. In most 6-regular toroidal graphs all 5-colorings are Kempe equivalent
9. Planar graphs of girth at least five are square (Δ + 2)-choosable
10. Planar graphs are 9/2-colorable
11. Coloring a graph with [formula omitted] colors: Conjectures equivalent to the Borodin–Kostochka conjecture that appear weaker
12. Sufficient sparseness conditions for [formula omitted] to be [formula omitted]-choosable, when [formula omitted]
13. Strong edge-coloring of cubic bipartite graphs: A counterexample
14. On the boundedness of positive solutions of the reciprocal max-type difference equation [formula omitted] with periodic parameters
15. Game matching number of graphs
16. Revolutionaries and spies: Spy-good and spy-bad graphs
17. Linear choosability of sparse graphs
18. Injective colorings of sparse graphs
19. Choice number of complete multipartite graphs [formula omitted] and [formula omitted]
20. Nomadic decompositions of bidirected complete graphs
21. Short proofs for cut-and-paste sorting of permutations
22. Strong edge-coloring of graphs with maximum degree 4 using 22 colors
Catalog
Books, media, physical & digital resources
Discovery Service for Jio Institute Digital Library
For full access to our library's resources, please sign in.