Covers of Eulerian graphs. (English) Zbl 1031.05105
Summary: It is proved that every Eulerian simple graph on \(n\) vertices can be covered by at most \(\lfloor \frac {n-1}{2} \rfloor\) circuits such that each edge is covered an odd number of times. This settles a conjecture made by Chung in 1980 [F. R. K. Chung, Discrete Math. 30, 89-93 (1980; Zbl 0451.05037)].
MSC:
| 05C70 | Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) |
| 05C45 | Eulerian and Hamiltonian graphs |
Citations:
Zbl 0451.05037References:
| [1] | Bondy, J. A., Basic graph theory: paths and circuits, (Graham, R. L.; Grotschel, M.; Lovász, L., Handbook of Combinatorics (1995), Elsevier: Elsevier Amsterdam), 3-100 · Zbl 0849.05044 |
| [2] | Bondy, J. A.; Murty, U. S.R., Graph Theory with Application (1976), Macmillan: Macmillan London · Zbl 1134.05001 |
| [3] | Chung, F. R.K., On the coverings of graphs, Discrete Math., 30, 89-93 (1980) · Zbl 0451.05037 |
| [4] | Erdös, P.; Goodman, A. W.; Pósa, L., The representation of graphs by set intersections, Canad. J. Math., 18, 106-112 (1966) · Zbl 0137.43202 |
| [5] | Fan, G., Subgraph coverings and edge switchings, J. Combin. Theory Ser. B, 84, 54-83 (2002) · Zbl 1031.05104 |
| [6] | Lovász, L., On covering of graphs, (Erdös, P.; Katona, G., Theory of Graphs (1968), Academic Press), 231-236 · Zbl 0157.31202 |
| [7] | Pyber, L., An Erdös-Gallai conjecture, Combinatorica, 5, 67-79 (1985) · Zbl 0581.05043 |
| [8] | Pyber, L., Covering the edges of a graph, Colloq. Math. Soc. János Bolyai, 60, 583-610 (1991) · Zbl 0792.05110 |
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. In some cases that data have been complemented/enhanced by data from zbMATH Open. This attempts to reflect the references listed in the original paper as accurately as possible without claiming completeness or a perfect matching.
