A note on covering the edges of a graph with bonds

DOI10.1016/S0012-365X(99)90125-5MaRDI QIDQ1292867zbMATH OpenFDO

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

Publication date 9 August 1999

Published in Discrete Mathematics (Search for Journal in Brave)

zbMATH Keywords

connected graphcircumferenceconvexbonds

Mathematics Subject Classification ID

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

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

Cites work

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

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)