18 results on '"Cranston, Daniel W."'
Search Results
2. Edge Lower Bounds for List Critical Graphs, Via Discharging.
3. Subcubic Edge-Chromatic Critical Graphs Have Many Edges.
4. LIST-COLORING CLAW-FREE GRAPHS WITH Δ - 1 COLORS.
5. Brooks' Theorem and Beyond.
6. GRAPHS WITH χ = Δ HAVE BIG CLIQUES.
7. Regular Graphs of Odd Degree Are Antimagic.
8. Sufficient sparseness conditions for to be -choosable, when.
9. Game matching number of graphs.
10. COLORING CLAW-FREE GRAPHS WITH Δ -- 1 COLORS.
11. Revolutionaries and spies: Spy-good and spy-bad graphs
12. Linear choosability of sparse graphs
13. Injective colorings of sparse graphs
14. CLASSES OF 3-REGULAR GRAPHS THAT ARE (7, 2)-EDGE-CHOOSABLE.
15. EDGE-CHOOSABILITY AND TOTAL-CHOOSABILITY OF PLANAR GRAPHS WITH NO ADJACENT 3-CYCLES.
16. Nomadic decompositions of bidirected complete graphs
17. THE 1, 2, 3-CONJECTURE AND 1, 2-CONJECTURE FOR SPARSE GRAPHS.
18. Choice number of complete multipartite graphs K3∗3,2∗(k−5),1∗2 and K4,3∗2,2∗(k−6),1∗3
Catalog
Books, media, physical & digital resources
Discovery Service for Jio Institute Digital Library
For full access to our library's resources, please sign in.