The tree number of a graph with a given girth

DOI10.1007/BF01848836zbMATH Open0626.05014OpenAlexW2029657243MaRDI QIDQ580352FDOQ580352

Authors: Mirosław Truszczyński 

Publication date: 1988

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

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

Recommendations

• Tree-thickness and caterpillar-thickness under girth constraints
• Minimum degree and minimum number of edge-disjoint trees
• On the tree number of regular graphs
• Packing and decomposition of graphs with trees
• On a conjecture about trees in graphs with large girth

zbMATH Keywords

girthtree decompositioncomplete bipartite graphstree numbern- dimensional cubes

Mathematics Subject Classification ID

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

Cites Work

• Decomposition of Finite Graphs Into Forests
• Title not available (Why is that?)
• Title not available (Why is that?)
• The linear arboricity of some regular graphs
• On partitions of graphs into trees
• Title not available (Why is that?)

Cited In (6)

• Minimum degree and minimum number of edge-disjoint trees
• The \(k\)-in-a-tree problem for graphs of girth at least \(k\)
• Tree-thickness and caterpillar-thickness under girth constraints
• On the tree number of regular graphs
• Title not available (Why is that?)
• On a conjecture about trees in graphs with large girth

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

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