Smallest (1, 2)-eulerian weight and shortest cycle covering

Authors:
Cheng Zhao
Affiliations:
Department of Mathematics West Virginia University Morgantown, West Virginia
Venue:
Journal of Graph Theory
Year:
1994

Citing 6
Cited 0

Minimum cycle coverings and integer flows

Journal of Graph Theory
Shortest circuit covers and postman tours in graphs with a nowhere zero 4-flow

SIAM Journal on Computing
Integer flows and cycle covers

Journal of Combinatorial Theory Series B
Cycle covers of cubic multigraphs

Discrete Mathematics
Covering a Graph by Circuits

Proceedings of the Fifth Colloquium on Automata, Languages and Programming
Graph Theory With Applications

Graph Theory With Applications

Quantified Score

Hi-index	0.00

Visualization

Abstract

The concept of a (1, 2)-eulerian weight was introduced and studied in several papers recently by Seymour, Alspach, Goddyn, and Zhang. In this paper, we proved that if G is a 2-connected simple graph of order n (n ≧ 7) and w is a smallest (1, 2)-eulerian weight of graph G, then |Ew=even | n - 4, except for a family of graphs. Consequently, if G admits a nowhere-zero 4-flow and is of order at least 7, except for a family of graphs, the total length of a shortest cycle covering is at most | V(G) | + |E(G) |- 4. This result generalizes some previous results due to Bermond, Jackson, Jaeger, and Zhang. © 1994 Wiley Periodicals, Inc.