Show simple item record

dc.contributor.advisorQuinn, J.
dc.contributor.authorDavidson, Nicholas
dc.date.accessioned2020-08-13T14:57:28Z
dc.date.available2020-08-13T14:57:28Z
dc.date.issued2002-01-01 0:00
dc.identifier.urihttps://scholar.oxy.edu/handle/20.500.12711/1013
dc.description.abstractUsing 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 degree of a vertex in the bipartite graph. In the process we discovered some interesting characteristics of line graphs of bipartite graphs, namely that the clique graph of the line graph yields the original graph minus vertices of degree 1. This fact not only holds for bipartite graphs but for all triangle-free graphs.
dc.description.sponsorshipNational Science Foundation - Award for the Integration of Research in Education Fellowship
dc.titleEdge Coloring Graphs with Distance Restrictions
dc.typearticle
dc.abstract.formathtml
dc.description.departmentmath
dc.source.issueurc_student
dc.identifier.legacyhttps://scholar.oxy.edu/urc_student/531
dc.source.statuspublished


Files in this item

FilesSizeFormatView

There are no files associated with this item.

This item appears in the following Collection(s)

Show simple item record