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

DOI10.1007/S00373-014-1464-7zbMATH Open1321.05100OpenAlexW2003368354MaRDI QIDQ497352FDOQ497352

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

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

zbMATH Keywords

spanning subgraph

Mathematics Subject Classification ID

Flows in graphs (05C21)

Cites Work

• A Contribution to the Theory of Chromatic Polynomials
• The Tutte polynomial
• Flows and generalized coloring theorems in graphs
• Title not available (Why is that?)
• Nowhere-zero 6-flows
• Reduction of the 5-flow conjecture to cyclically 6-edge-connected snarks.
• Balanced Valuations and Flows in Multigraphs
• Title not available (Why is that?)
• Title not available (Why is that?)
• On perfect matching coverings and even subgraph coverings
• Title not available (Why is that?)
• Intersecting 1-factors and nowhere-zero 5-flows

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)