24 results on '"Cranston, Daniel W."'
Search Results
2. Optimally reconfiguring list and correspondence colourings
3. Odd-sum colorings of planar graphs
4. A note on odd colorings of 1-planar graphs
5. On asymptotic packing of geometric graphs
6. Strong edge-coloring of cubic bipartite graphs: A counterexample
7. List-recoloring of sparse graphs
8. Kempe equivalent list edge-colorings of planar graphs
9. In most 6-regular toroidal graphs all 5-colorings are Kempe equivalent
10. Planar graphs of girth at least five are square (Δ + 2)-choosable
11. Planar graphs are 9/2-colorable
12. Choice number of complete multipartite graphs K3∗3,2∗(k−5),1∗2 and K4,3∗2,2∗(k−6),1∗3
13. An introduction to the discharging method via graph coloring
14. Coloring a graph with Δ−1 colors: Conjectures equivalent to the Borodin–Kostochka conjecture that appear weaker
15. Sufficient sparseness conditions forG2to be(Δ+1)-choosable, whenΔ≥5
16. Hamiltonicity in connected regular graphs
17. On the boundedness of positive solutions of the reciprocal max-type difference equation xn=maxAn-11xn-1,An-12xn-2,⋯,An-1txn-t with periodic parameters
18. Game matching number of graphs
19. Revolutionaries and spies: Spy-good and spy-bad graphs
20. Linear choosability of sparse graphs
21. Injective colorings of sparse graphs
22. Nomadic decompositions of bidirected complete graphs
23. Short proofs for cut-and-paste sorting of permutations
24. 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.