Modulo orientations with bounded out-degrees

DOI10.1016/j.disc.2023.113634zbMath1525.05155arXiv1702.07039OpenAlexW4386079324MaRDI QIDQ6080113

Morteza Hasanvand

Publication date: 30 October 2023

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1702.07039

zbMATH Keywords

modulo orientationout-degreeedge-connected graphpartition-connected graph

Mathematics Subject Classification ID

Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Connectivity (05C40)

Cites Work

• Unnamed Item
• Decomposing graphs into a constant number of locally irregular subgraphs
• Decomposing highly edge-connected graphs into homomorphic copies of a fixed tree
• Edge-decomposition of graphs into copies of a tree with four edges
• The weak 3-flow conjecture and the weak circular flow conjecture
• Nowhere-zero 3-flows and modulo \(k\)-orientations
• Eulerian graphs and related topics. Part 1, Volume 1
• Counterexamples to Jaeger's circular flow conjecture
• The existence of planar 4-connected essentially 6-edge-connected graphs with no claw-decompositions
• Equitable factorizations of edge-connected graphs
• Factorizing regular graphs
• Covering directed and odd cuts
• On the Problem of Decomposing a Graph into n Connected Factors
• Edge-Disjoint Spanning Trees of Finite Graphs
• Nowhere‐zero 3‐flow and ‐connectedness in graphs with four edge‐disjoint spanning trees
• Additive Bases and Flows in Graphs