On the tree number of regular graphs

DOI10.1016/S0012-365X(96)00193-8MaRDI QIDQ1356782zbMATH OpenOpenAlexFDO

Authors Anna Lladó, Oriol Serra, Gerhard Ringel

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

arboricityregular graphstree decompositionedge-connectivitytree 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)

Recommendations

• The number of spanning trees in regular graphs
• scientific article; zbMATH DE number 2044920
• On \(n\)th order degree regular trees
• On the tree cover number of a graph
• Counting trees in directed regular multigraphs
• The forest number in several classes of regular graphs
• On the total domatic number of regular graphs
• On the chromatic number of tree graphs
• scientific article; zbMATH DE number 5003360
• The number of spanning trees of the regular networks

Cites work

• scientific article; zbMATH DE number 3547328 (Why is no real title available?)
• Decomposition of Finite Graphs Into Forests
• On partitions of graphs into trees
• Orienting planar graphs
• Planar graphs and poset dimension
• The tree number of a graph with a given girth
• Two trees in maximal planar bipartite graphs

Cited in

(5)

• Minimum degree and minimum number of edge-disjoint trees
• The tree number of a graph with a given girth
• Higher edge-connectivities and tree decompositions in regular graphs
• On the tree cover number of a graph
• scientific article; zbMATH DE number 5003360 (Why is no real title available?)

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

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