On a tree graph defined by a set of cycles

DOI10.1016/S0012-365X(03)00132-8zbMath1021.05025OpenAlexW2014614080MaRDI QIDQ1408887

Víctor Neumann-Lara, Eduardo Rivera-Campo, Xue Liang Li

Publication date: 25 September 2003

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

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

zbMATH Keywords

cycle spacetree graph\(\Delta^{\ast}\)-dense

Mathematics Subject Classification ID

Trees (05C05) Paths and cycles (05C38) Combinatorial aspects of matroids and geometric lattices (05B35)

Related Items (6)

On the perfect matching graph defined by a set of cycles ⋮ The biplanar tree graph ⋮ Unnamed Item ⋮ Spanning trees: A survey ⋮ The basis graph of a bicolored matroid ⋮ On the basis graph of a bicolored matroid

Cites Work

• Interpolation theorem for diameters of spanning trees
• A lower bound on the number of spanning trees withk end-vertices
• On the Tree Graph of a Matroid
• Unnamed Item
• Unnamed Item

This page was built for publication: On a tree graph defined by a set of cycles