A note on covering the edges of a graph with bonds

DOI10.1016/S0012-365X(99)90125-5zbMATH Open0929.05067MaRDI QIDQ1292867FDOQ1292867

V. Neumann-Lara, E. Rivera-Campo, J. Urrutia

Publication date: 9 August 1999

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

Recommendations

• Bonds intersecting cycles in a graph
• An Upper Bound on the Number of Edges of a 2-Connected Graph
• Cycle covers of planar 2-edge-connected graphs
• Subgraph coverings and edge switchings

zbMATH Keywords

connected graphcircumferenceconvexbonds

Mathematics Subject Classification ID

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

Cites Work

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

Cited In (4)

• Bonds intersecting cycles in a graph
• Circuit and fractional circuit covers of matroids
• On cocircuit covers of bicircular matroids
• Stability results on the circumference of a graph

This page was built for publication: A note on covering the edges of a graph with bonds

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