Integer Flows and Cycle Covers of Graphs 论文

1997引用 287
Advanced Graph Theory ResearchComplexity and Algorithms in Graphs

摘要

Introduction to integer flows basic properties of integer flows nowhere-zero 4-flows nowhere-zero 3-flows nowhere-zero k-flows faithful cycle covers cycle double covers shortest cycle covers generalization and unification compatible decompositions. Appendices: fundamental theories hints for exercises terminology.

相关事件

暂无数据

相关文章

暂无数据