scientific article; zbMATH DE number 109206

zbMATH Open0776.05087MaRDI QIDQ4024342FDOQ4024342

Authors: A. Ya. Petrenyuk 

Publication date: 9 March 1993

Title of this publication is not available (Why is that?)

Recommendations

• Efficiently enumerating minimal triangulations
• scientific article; zbMATH DE number 2154966
• Minimal path decomposition of complete bipartite graphs
• scientific article; zbMATH DE number 1933250
• scientific article; zbMATH DE number 3924794

zbMATH Keywords

treesalgorithmenumerationcomplete graphFORTRAN

Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85) Extremal problems in graph theory (05C35) Enumeration in graph theory (05C30) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Cited In (4)

• Graph minors. XVIII: Tree-decompositions and well-quasi-ordering
• On the minimum number of components in a cotree of a graph
• Title not available (Why is that?)
• The 22 minimal dichotomy decompositions of the \(K_5\)-distance

This page was built for publication:

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