Search filters

List of works by Daniel Wesley Cranston

A characterization of (4,2)‐choosable graphs

scholarly article

Coloring a graph with <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" altimg="si10.gif" display="inline" overflow="scroll"><mml:mi>Δ</mml:mi><mml:mo>−</mml:mo><mml:mn>1</mml:mn></mml:math> colors: Conjectures equivalent to the Borodin–Kosto

scientific article published in 2015

Graph Coloring Methods ⬇️

free textbook by Daniel W. Cranston

Injective Colorings of Graphs with Low Average Degree

scientific article published in 2010

Injective colorings of sparse graphs

scientific article published in 2010

On asymptotic packing of geometric graphs

scientific article published in 2022

Planar Turán Numbers of Cycles: A Counterexample

scientific article published in 2022

Strong edge-coloring of cubic bipartite graphs: A counterexample

scientific article published in 2022

Strong edge-coloring of graphs with maximum degree 4 using 22 colors

The 1,2,3-Conjecture and 1,2-Conjecture for sparse graphs

scientific article published in 2014

The Hilton--Zhao Conjecture is True for Graphs with Maximum Degree 4

scientific article published in 2019

The fractional chromatic number of the plane

Paulina is supported by:

About Paulina

Help