On the tree number of regular graphs

DOI10.1016/S0012-365X(96)00193-8zbMath0878.05068OpenAlexW2048067759MaRDI QIDQ1356782

Anna S. Lladó, Oriol Serra

Publication date: 5 January 1998

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0012-365x(96)00193-8

zbMATH Keywords

regular graphstree decompositionedge-connectivityarboricitytree number

Mathematics Subject Classification ID

Trees (05C05) Extremal problems in graph theory (05C35) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Related Items (1)

Minimum degree and minimum number of edge-disjoint trees

Cites Work

• Unnamed Item
• The tree number of a graph with a given girth
• Planar graphs and poset dimension
• Orienting planar graphs
• On partitions of graphs into trees
• Two trees in maximal planar bipartite graphs
• Decomposition of Finite Graphs Into Forests

This page was built for publication: On the tree number of regular graphs