The six bidecomposable graphs

DOI10.1002/JGT.3190100114MaRDI QIDQ3720647zbMATH OpenOpenAlexFDO

Authors Kiyoshi Ando, Hirobumi Mizuno

Publication date 1986

Published in Journal of Graph Theory (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1002/jgt.3190100114

zbMATH Keywords

bidecomposable graphsdecomposable graphsgraph decomposition

Mathematics Subject Classification ID

Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Graph theory (05C99)

Recommendations

• scientific article; zbMATH DE number 6081
• The bigraph decomposition number of a graph
• On the completeness of decomposable properties of graphs
• On the shape of decomposable trees
• Bipartite graphs totally decomposable by canonical decomposition

Cited in

(10)

• Graphs G for which G and \(\bar G\) are both semidecomposable
• On forcibly hereditary P-graphical sequences
• Graphs with six distinct matching roots
• The bigraph decomposition number of a graph
• scientific article; zbMATH DE number 3966133 (Why is no real title available?)
• The \((\leq 6)\)-half-reconstructibility of digraphs
• scientific article; zbMATH DE number 1279107 (Why is no real title available?)
• scientific article; zbMATH DE number 2113498 (Why is no real title available?)
• scientific article; zbMATH DE number 898425 (Why is no real title available?)
• SHILLA GRAPHS WITH \(b=5\) AND \(b=6\)

This page was built for publication: The six bidecomposable graphs

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