View Item 

Show simple item record

The chromatic index of graphs with large maximum degree
dc.contributor.authorPlantholt, Michael J.en_US
dc.date.accessioned2006-04-07T18:48:06Z
dc.date.available2006-04-07T18:48:06Z
dc.date.issued1983en_US
dc.identifier.citationPlantholt, Michael J. (1983)."The chromatic index of graphs with large maximum degree." Discrete Mathematics 47(): 91-96. <http://hdl.handle.net/2027.42/25365>en_US
dc.identifier.urihttp://www.sciencedirect.com/science/article/B6V00-47S0Y6F-9/2/7a549228f3982ed77098dbd2589edec8en_US
dc.identifier.urihttps://hdl.handle.net/2027.42/25365
dc.description.abstractBy Vizing's Theorem, any graph G has chromatic index equal either to its maximum degree [Delta](G) or [Delta](G) + 1. A simple method is given for determining exactly the chromatic index of any graph with 2s + 2 vertices and maximum degree 2s.en_US
dc.format.extent519784 bytes
dc.format.extent3118 bytes
dc.format.mimetypeapplication/pdf
dc.format.mimetypetext/plain
dc.language.isoen_US
dc.publisherElsevieren_US
dc.titleThe chromatic index of graphs with large maximum degreeen_US
dc.typeArticleen_US
dc.rights.robotsIndexNoFollowen_US
dc.subject.hlbsecondlevelMathematicsen_US
dc.subject.hlbtoplevelScienceen_US
dc.description.peerreviewedPeer Revieweden_US
dc.contributor.affiliationumThe University of Michigan and Illinois State University, Normal, IL 61761, USAen_US
dc.description.bitstreamurlhttp://deepblue.lib.umich.edu/bitstream/2027.42/25365/1/0000813.pdfen_US
dc.identifier.doihttp://dx.doi.org/10.1016/0012-365X(83)90074-2en_US
dc.identifier.sourceDiscrete Mathematicsen_US
dc.owningcollnameInterdisciplinary and Peer-Reviewed


Files in this item

Name:
0000813.pdf
Size:
507.6KB
Format:
PDF
View/Open

Show simple item record

Remediation of Harmful Language

The University of Michigan Library aims to describe library materials in a way that respects the people and communities who create, use, and are represented in our collections. Report harmful or offensive language in catalog records, finding aids, or elsewhere in our collections anonymously through our metadata feedback form. More information at Remediation of Harmful Language.

Accessibility

If you are unable to use this file in its current format, please select the Contact Us link and we can modify it to make it more accessible to you.