A note on covering the edges of a graph with bonds

DOI10.1016/S0012-365X(99)90125-5zbMath0929.05067MaRDI QIDQ1292867

Eduardo Rivera-Campo, Jorge Urrutia, Víctor Neumann-Lara

Publication date: 9 August 1999

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

zbMATH Keywords

convexcircumferenceconnected graphbonds

Mathematics Subject Classification ID

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

Related Items

On cocircuit covers of bicircular matroids ⋮ Circuit and fractional circuit covers of matroids

Cites Work

• Unnamed Item
• An Upper Bound on the Number of Edges of a 2-Connected Graph
• Connectivity in Matroids