Parity subgraphs with few common edges and nowhere-zero 5-flow

DOI10.1007/S00373-014-1464-7MaRDI QIDQ497352zbMATH OpenOpenAlexFDO

Authors Jiaao Li, Zhen-Mu Hong, Xiaofeng Ding, Xinmin Hou

Publication date 24 September 2015

Published in Graphs and Combinatorics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s00373-014-1464-7

zbMATH Keywords

spanning subgraph

Mathematics Subject Classification ID

Flows in graphs (05C21)

Recommendations

• Intersecting 1-factors and nowhere-zero 5-flows
• Nowhere-zero 5-flows
• Nowhere-zero 5-flows and even (1,2)-factors
• Flows and parity subgraphs of graphs with large odd-edge-connectivity

Cites work

• scientific article; zbMATH DE number 4075098 (Why is no real title available?)
• scientific article; zbMATH DE number 3506734 (Why is no real title available?)
• scientific article; zbMATH DE number 3508211 (Why is no real title available?)
• scientific article; zbMATH DE number 863473 (Why is no real title available?)
• A Contribution to the Theory of Chromatic Polynomials
• Balanced Valuations and Flows in Multigraphs
• Flows and generalized coloring theorems in graphs
• Intersecting 1-factors and nowhere-zero 5-flows
• Nowhere-zero 6-flows
• On perfect matching coverings and even subgraph coverings
• Reduction of the 5-flow conjecture to cyclically 6-edge-connected snarks.
• The Tutte polynomial

Cited in

(2)

• Flows and parity subgraphs of graphs with large odd-edge-connectivity
• Measures of edge-uncolorability of cubic graphs

This page was built for publication: Parity subgraphs with few common edges and nowhere-zero 5-flow

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