Note on the spanning-tree packing number of lexicographic product graphs

DOI10.1016/j.disc.2014.12.007zbMath1306.05206MaRDI QIDQ2514151

Hengzhe Li, Jun Yue, Yaping Mao, Xue Liang Li

Publication date: 30 January 2015

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

Full work available at URL: https://doi.org/10.1016/j.disc.2014.12.007

zbMATH Keywords

packing; connectivity; lexicographic product; edge-disjoint spanning trees

Mathematics Subject Classification ID

05C05: Trees

05C70: Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.)

05C40: Connectivity

05C76: Graph operations (line graphs, products, etc.)

Related Items

On extremal graphs with exactly one Steiner tree connecting any $k$ vertices, Graphs with large generalized (edge-)connectivity, Tree connectivities of Cayley graphs on abelian groups with small degrees, Clustering analysis of a dissimilarity: a review of algebraic and geometric representation, A result on the 3-generalized connectivity of a graph and its line graph, The minimum size of a graph with given tree connectivity

Cites Work

• Unnamed Item
• Spanning trees: A survey
• On decomposition of r-partite graphs into edge-disjoint Hamilton circuits
• Combinatorial optimization. Polyhedra and efficiency (3 volumes)
• On Hamilton circuits and Hamilton paths
• A Note on Finding Minimum-Cost Edge-Disjoint Spanning Trees
• On the edge‐toughness of a graph. II
• On the spanning tree packing number of a graph: A survey