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

DOI10.1016/0012-365X(79)90024-4MaRDI QIDQ1132898zbMATH OpenOpenAlexWikidataFDO

Authors 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

arboricitydecompositionEulerianline graphmiddle graphminimum number of line-disjoint spanning foreststotal graph

Mathematics Subject Classification ID

Trees (05C05) Graph theory (05C99)

Cites work

• Decomposition of Finite Graphs Into Forests
• Edge-Disjoint Spanning Trees of Finite Graphs
• scientific article; zbMATH DE number 3222646 (Why is no real title available?)
• scientific article; zbMATH DE number 3284076 (Why is no real title available?)
• Parallel concepts in graph theory
• Traversability and connectivity of the middle graph of a graph

Cited in

(2)

• scientific article; zbMATH DE number 4085704 (Why is no real title available?)
• Graph theory (algorithmic, algebraic, and metric problems)

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1132898)