The tree number of a graph with a given girth

DOI10.1007/BF01848836zbMath0626.05014OpenAlexW2029657243MaRDI QIDQ580352

Miroslaw Truszczynski

Publication date: 1988

Published in: Periodica Mathematica Hungarica (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf01848836

zbMATH Keywords

tree decompositiongirthcomplete bipartite graphstree numbern- dimensional cubes

Mathematics Subject Classification ID

Trees (05C05) Extremal problems in graph theory (05C35)

Related Items (2)

On the tree number of regular graphs ⋮ Minimum degree and minimum number of edge-disjoint trees

Cites Work

• On partitions of graphs into trees
• The linear arboricity of some regular graphs
• Decomposition of Finite Graphs Into Forests
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: The tree number of a graph with a given girth