Journal of Jilin University (Information Science Edition) ›› 2023, Vol. 41 ›› Issue (1): 112-117.

Previous Articles     Next Articles

Upper Boundary of Shortest Cycle Covers of Bridgeless Graphs

WANG Xiao, TANG Shaoru   

  1. (School of Mathematics and Computer Application, Shangluo University, Shangluo 726000, China)
  • Received:2022-03-15 Online:2023-02-08 Published:2023-02-09

Abstract: Even subgraph covers is an important subject in graph theory. Inorder to study the shortest cycle covers conjecture, using the connection between integer flows and even subgraph covers, a new upper boundary of shortest cycle covers of bridgeless graphs is obtained by means of the conclusion of expanding an integer 4-flow in a circuit of a graph. The result improves Fan's conclusion.

Key words: integer flow, subgraph covers, shortest cycle covers

CLC Number: 

  • TP301