The following pages link to Daniel W. Cranston (Q311578):
Displaying 50 items.
- Planar graphs have independence ratio at least 3/13 (Q311579) (← links)
- The \(1,2,3\)-conjecture and \(1,2\)-conjecture for sparse graphs (Q472134) (← links)
- Coloring a graph with \(\Delta-1\) colors: conjectures equivalent to the Borodin-Kostochka conjecture that appear weaker (Q472396) (← links)
- An introduction to the discharging method via graph coloring (Q507506) (← links)
- Injective colorings of graphs with low average degree (Q548659) (← links)
- Injective colorings of sparse graphs (Q710598) (← links)
- The fractional chromatic number of the plane (Q722307) (← links)
- Sufficient sparseness conditions for \(G^2\) to be \((\Delta + 1)\)-choosable, when \(\Delta \geq 5\) (Q741736) (← links)
- On the boundedness of positive solutions of the reciprocal MAX-type difference equation \(x_n=\max\left\{\frac{A_{n-1}^1}{x_{n-1}},\frac{A_{n-1}^2}{x_{n-2}},\cdots,\frac{A_{n-1}^t}{x_{n-t}}\right\}\) with periodic parameters (Q905276) (← links)
- Nomadic decompositions of bidirected complete graphs (Q932653) (← links)
- Choice number of complete multipartite graphs \(K_{3*3,2*(k - 5),1*2}\) and \(K_{4,3*2,2*(k - 6),1*3}\) (Q998482) (← links)
- Crossings, colorings, and cliques (Q1028822) (← links)
- Multigraphs with \(\Delta \geq 3\) are totally-\((2\Delta - 1)\)-choosable (Q1043786) (← links)
- Planar graphs of girth at least five are square \((\delta + 2)\)-choosable (Q1633752) (← links)
- Proper distinguishing colorings with few colors for graphs with girth at least 5 (Q1658779) (← links)
- Edge lower bounds for list critical graphs, via discharging (Q1715067) (← links)
- Planar graphs are \(9/2\)-colorable (Q1791701) (← links)
- Revolutionaries and spies: spy-good and spy-bad graphs (Q1929215) (← links)
- Revolutionaries and spies on trees and unicyclic graphs (Q1937355) (← links)
- New results in \(t\)-tone coloring of graphs (Q1953497) (← links)
- On asymptotic packing of geometric graphs (Q2081476) (← links)
- In most 6-regular toroidal graphs all 5-colorings are Kempe equivalent (Q2143401) (← links)
- List-recoloring of sparse graphs (Q2145762) (← links)
- Planar Turán numbers of cycles: a counterexample (Q2170782) (← links)
- Strong edge-coloring of cubic bipartite graphs: a counterexample (Q2172406) (← links)
- Linear choosability of sparse graphs (Q2275448) (← links)
- A note on coloring vertex-transitive graphs (Q2341047) (← links)
- Chain-making games in grid-like posets (Q2375851) (← links)
- A new lower bound on the density of vertex identifying codes for the infinite hexagonal grid (Q2380272) (← links)
- Beyond degree choosability (Q2401410) (← links)
- Modified linear programming and class 0 bounds for graph pebbling (Q2410032) (← links)
- Strong edge-coloring of graphs with maximum degree 4 using 22 colors (Q2433734) (← links)
- Hamiltonicity in connected regular graphs (Q2445323) (← links)
- Game matching number of graphs (Q2446826) (← links)
- Short proofs for cut-and-paste sorting of permutations (Q2461214) (← links)
- Painting squares in \(\Delta^2-1\) shades (Q2629492) (← links)
- Degeneracy and colorings of squares of planar graphs without 4-cycles (Q2658379) (← links)
- A note on odd colorings of 1-planar graphs (Q2689651) (← links)
- Choosability of the square of a planar graph with maximum degree four (Q2876030) (← links)
- Overlap number of graphs (Q2888876) (← links)
- List colorings of \(K_5\)-minor-free graphs with special list assignments (Q2911050) (← links)
- Regular Graphs of Odd Degree Are Antimagic (Q2947855) (← links)
- Graphs with $\chi=\Delta$ Have Big Cliques (Q2949718) (← links)
- (Q3001606) (← links)
- A characterization of (4,2)‐choosable graphs (Q3299217) (← links)
- Brooks' Theorem and Beyond (Q3466339) (← links)
- List-coloring the square of a subcubic graph (Q3539931) (← links)
- Classes of 3-Regular Graphs That Are (7, 2)-Edge-Choosable (Q3563947) (← links)
- Regular bipartite graphs are antimagic (Q3608318) (← links)
- Star coloring of sparse graphs (Q3652552) (← links)
