The tree number of a graph with a given girth

DOI10.1007/BF01848836MaRDI QIDQ580352zbMATH OpenOpenAlexFDO

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

zbMATH Keywords

girthtree decompositioncomplete bipartite graphstree numbern- dimensional cubes

Mathematics Subject Classification ID

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

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

Cites work

• scientific article; zbMATH DE number 3654142 (Why is no real title available?)
• scientific article; zbMATH DE number 3726401 (Why is no real title available?)
• scientific article; zbMATH DE number 3262259 (Why is no real title available?)
• Decomposition of Finite Graphs Into Forests
• On partitions of graphs into trees
• The linear arboricity of some regular graphs

Cited in

(6)

• scientific article; zbMATH DE number 5305008 (Why is no real title available?)
• On the tree number of regular graphs
• The \(k\)-in-a-tree problem for graphs of girth at least \(k\)
• Minimum degree and minimum number of edge-disjoint trees
• On a conjecture about trees in graphs with large girth
• Tree-thickness and caterpillar-thickness under girth constraints

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)