A note on covering the edges of a graph with bonds (Q1292867): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
ReferenceBot (talk | contribs) Changed an Item |
||
(3 intermediate revisions by 2 users not shown) | |||
Property / author | |||
Property / author: Víctor Neumann-Lara / rank | |||
Property / author | |||
Property / author: Víctor Neumann-Lara / rank | |||
Normal rank | |||
Property / MaRDI profile type | |||
Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q5422499 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Connectivity in Matroids / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: An Upper Bound on the Number of Edges of a 2-Connected Graph / rank | |||
Normal rank |
Latest revision as of 21:36, 28 May 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | A note on covering the edges of a graph with bonds |
scientific article |
Statements
A note on covering the edges of a graph with bonds (English)
0 references
9 August 1999
0 references
This paper concentrates to prove the following result: If \(G\) is a 2-connected graph with circumference \(c\), then there are \(c\) bonds \(B_1,B_2,\dots, B_c\) of \(G\), not necessarily different, such that every edge of \(G\) lies in at least two of them. This result is stronger than the one proved by Wu Pou-Lin saying that if \(G\) is a 2-connected graph with circumference \(c\), then \(cc'\geq 2| E(G)|\), where \(c'\) is the size of the largest bonds of \(G\).
0 references
convex
0 references
connected graph
0 references
circumference
0 references
bonds
0 references