The chromatic index of graphs with a spanning star
dc.contributor.author | Plantholt, Mike | |
dc.date.accessioned | 2018-05-15T20:15:24Z | |
dc.date.available | 2018-05-15T20:15:24Z | |
dc.date.issued | 1981-03 | |
dc.identifier.citation | Plantholt, Mike (1981). "The chromatic index of graphs with a spanning star." Journal of Graph Theory 5(1): 45-53. | |
dc.identifier.issn | 0364-9024 | |
dc.identifier.issn | 1097-0118 | |
dc.identifier.uri | https://hdl.handle.net/2027.42/143749 | |
dc.description.abstract | Vizing’s Theorem states that any graph G has chromatic index either the maximum degree Δ(G) or Δ(G) + 1. If G has 2s + 1 points and Δ(G) = 2s, a well‐known necessary condition for the chromatic index to equal 2s is that G have at most 2s2 lines. Hilton conjectured that this condition is also sufficient. We present a proof of that conjecture and a corollary that helps determine the chromatic index of some graphs with 2s points and maximum degree 2s − 2. | |
dc.publisher | Wiley Subscription Services, Inc., A Wiley Company | |
dc.title | The chromatic index of graphs with a spanning star | |
dc.type | Article | en_US |
dc.rights.robots | IndexNoFollow | |
dc.subject.hlbsecondlevel | Mathematics | |
dc.subject.hlbtoplevel | Science | |
dc.description.peerreviewed | Peer Reviewed | |
dc.contributor.affiliationum | University of Michigan Ann Arbor, Michigan | |
dc.description.bitstreamurl | https://deepblue.lib.umich.edu/bitstream/2027.42/143749/1/3190050103_ftp.pdf | |
dc.identifier.doi | 10.1002/jgt.3190050103 | |
dc.identifier.source | Journal of Graph Theory | |
dc.identifier.citedreference | S. Fiorini and R. J. Wilson, Edge‐Colorings of Graphs. Pitman, London ( 1977 ). | |
dc.identifier.citedreference | V. G. Vizing, On an estimate of the chromatic class of a p‐graph (Russian) Diskret. Analiz 3 ( 1964 ) 25 – 30. | |
dc.identifier.citedreference | F. Harary, Graph Theory. Addison‐Wesley, Reading, MA ( 1969 ). | |
dc.identifier.citedreference | A. J. W. Hilton, Definitions of criticality with respect to edge‐coloring. J. Graph Theory. 1 ( 1977 ) 61 – 68. | |
dc.identifier.citedreference | J. Folkman and D. R. Fulkerson, Edge colorings in bipartite graphs. Combinatorial Mathematics and Its Applications.Edited by R. C. Bose and T. A. Dowling. University of North Carolina Press, Chapel Hill ( 1969 ) 561 – 577. | |
dc.owningcollname | Interdisciplinary and Peer-Reviewed |
Files in this item
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.