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

DOI10.1016/0012-365X(79)90024-4zbMath0421.05056OpenAlexW2114166869WikidataQ126401408 ScholiaQ126401408MaRDI QIDQ1132898

Jin Akiyama, Takashi Hamada

Publication date: 1979

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0012-365x(79)90024-4

zbMATH Keywords

decompositionline graphEuleriantotal grapharboricitymiddle graphminimum number of line-disjoint spanning forests

Mathematics Subject Classification ID

Trees (05C05) Graph theory (05C99)

Related Items (2)

Unnamed Item ⋮ Graph theory (algorithmic, algebraic, and metric problems)

Cites Work

• Traversability and connectivity of the middle graph of a graph
• Parallel concepts in graph theory
• Edge-Disjoint Spanning Trees of Finite Graphs
• Decomposition of Finite Graphs Into Forests
• Unnamed Item
• Unnamed Item

This page was built for publication: The decompositions of line graphs, middle graphs and total graphs of complete graphs into forests