View Item 

Show simple item record

The decompositions of line graphs, middle graphs and total graphs of complete graphs into forests

dc.contributor.authorAkiyama, Jinen_US
dc.contributor.authorHamada, Takashien_US
dc.date.accessioned2006-04-07T17:38:55Z
dc.date.available2006-04-07T17:38:55Z
dc.date.issued1979en_US
dc.identifier.citationAkiyama, Jin, Hamada, Takashi (1979)."The decompositions of line graphs, middle graphs and total graphs of complete graphs into forests." Discrete Mathematics 26(3): 203-208. <http://hdl.handle.net/2027.42/23693>en_US
dc.identifier.urihttp://www.sciencedirect.com/science/article/B6V00-45JC8VW-C1/2/0ce12cec9fce5d8e28597885635c63f1en_US
dc.identifier.urihttps://hdl.handle.net/2027.42/23693
dc.description.abstractWe construct decompositions of L(Kn), M(Kn) and T(Kn) into the minimum number of line-disjoint spanning forests by applying the usual criterion for a graph to be eulerian. This gives a realization of the arboricity of each of these three graphs.en_US
dc.format.extent472089 bytes
dc.format.extent3118 bytes
dc.format.mimetypeapplication/pdf
dc.format.mimetypetext/plain
dc.language.isoen_US
dc.publisherElsevieren_US
dc.titleThe decompositions of line graphs, middle graphs and total graphs of complete graphs into forestsen_US
dc.typeArticleen_US
dc.rights.robotsIndexNoFollowen_US
dc.subject.hlbsecondlevelMathematicsen_US
dc.subject.hlbtoplevelScienceen_US
dc.description.peerreviewedPeer Revieweden_US
dc.contributor.affiliationumDepartment of Mathematics, University of Michigan, Ann Arbor, MI 48109, USAen_US
dc.contributor.affiliationotherDepartment of Applied Mathematics, Science University of Tokyo, Tokyo, 162 Japanen_US
dc.description.bitstreamurlhttp://deepblue.lib.umich.edu/bitstream/2027.42/23693/1/0000663.pdfen_US
dc.identifier.doihttp://dx.doi.org/10.1016/0012-365X(79)90024-4en_US
dc.identifier.sourceDiscrete Mathematicsen_US
dc.owningcollnameInterdisciplinary and Peer-Reviewed


Files in this item

Name:
0000663.pdf
Size:
461.0KB
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.