Generation of trees of a graph with the use of decomposition

DOI10.1016/0016-0032(84)90011-5zbMATH Open0549.05021OpenAlexW2036904957MaRDI QIDQ800368FDOQ800368

Authors: Jacek Wojciechowski 

Publication date: 1984

Published in: Journal of the Franklin Institute (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0016-0032(84)90011-5

Recommendations

• Decompositions of graphs into trees
• Tree decomposition of graphs
• Decomposition of complete graphs into arbitrary trees
• Tree decompositions for a class of graphs
• scientific article; zbMATH DE number 866654
• Tree-decompositions of graphs. I
• Decomposition of some planar graphs into trees
• Some results on tree decomposition of graphs
• scientific article; zbMATH DE number 4053039
• Decomposing graphs into paths and trees

zbMATH Keywords

graph decompositiontree generation

Mathematics Subject Classification ID

Trees (05C05) Enumeration in graph theory (05C30) Applications of graph theory to circuits and networks (94C15)

Cites Work

• Title not available (Why is that?)
• Parallel concepts in graph theory
• Dividing a Graph into Triconnected Components
• Title not available (Why is that?)
• A V log V algorithm for isomorphism of triconnected planar graphs
• Topological analysis and synthesis of linear systems
• An Analysis of the Wang Algebra of Networks

Cited In (5)

• Propagation tree decompositions and linearly independent vertices
• Applications of lattice theory to graph decomposition
• Finding a smooth frame decomposition of a graph
• Generation of polynomial-time algorithms for some optimization problems on tree-decomposable graphs
• Title not available (Why is that?)

Uses Software

• Algorithm 447

This page was built for publication: Generation of trees of a graph with the use of decomposition

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