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

DOI10.1002/JGT.3190180206zbMATH Open0798.05045OpenAlexW2077812264MaRDI QIDQ4284101FDOQ4284101

Authors: Cheng Zhao 

Publication date: 24 March 1994

Published in: Journal of Graph Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/jgt.3190180206

Recommendations

• scientific article; zbMATH DE number 553915
• Covering weighted graphs by even subgraphs
• Cycles in weighted graphs
• Cycle covers. II: Circuit chain, Petersen chain and Hamilton weights.
• Cycle covering in bridgeless graphs

zbMATH Keywords

Chinese postman problemEulerian weightparity subgraphtotal weightshortest cycle cover

Mathematics Subject Classification ID

Eulerian and Hamiltonian graphs (05C45) Paths and cycles (05C38) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Cites Work

• Matching, Euler tours and the Chinese postman
• Graph theory with applications
• Cycle covers of cubic multigraphs
• Covering Multigraphs by Simple Circuits
• Shortest coverings of graphs with cycles
• Even circuits in planar graphs
• Integer flows and cycle covers
• Cycle covering in bridgeless graphs
• Minimum cycle coverings and integer flows
• Shortest Circuit Covers and Postman Tours in Graphs with a Nowhere Zero 4
• Cycle covers of graphs with a nowhere-zero 4-flow

Cited In (2)

• A note about shortest cycle covers
• Title not available (Why is that?)

This page was built for publication: Smallest (1, 2)‐eulerian weight and shortest cycle covering

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4284101)