Now showing items 1-1 of 1

    • Edge Coloring Graphs with Distance Restrictions 

      Davidson, Nicholas (2002-01-01)
      Using probabilistic methods developed by Michael Molloy and Bruce Reed, we attempt to prove a conjecture that says the strong chromatic index for bipartite graphs is less than or equal to 5/4(D)^2$ where (D) is the maximum ...