Modulo orientations with bounded out-degrees

DOI10.1016/J.DISC.2023.113634MaRDI QIDQ6080113zbMATH OpenOpenAlexFDO

Authors 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

edge-connected graphmodulo orientationout-degreepartition-connected graph

Mathematics Subject Classification ID

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

Abstract: Let $G$ be a graph, let $k$ be a positive integer, and let $p:V(G)ightarrow{Z}_k$ be a mapping with $|E(G)|stackrelkequivsu{m}_{vinV(G)}p(v)$. In this paper, we show that if $G$ is $(3k-3)$-edge-connected, then it has an orientation such that for each vertex $v$, $|d_G^{+}(v)-d_G(v)/2|<k$; also if $G$ contains $2k-2$ edge-disjoint spanning trees, then it admits such an orientation but by imposing greater out-degree bounds.

Recommendations

• scientific article; zbMATH DE number 2248469
• scientific article; zbMATH DE number 2192196
• Orientations of graphs and minimum degrees of graphs.
• On Mod $(2s+1)$-Orientations of Graphs
• On weighted modulo orientation of graphs

Cites work

• A note on \([k,l]\)-sparse graphs
• Additive bases and flows in graphs
• Counterexamples to Jaeger's circular flow conjecture
• Covering directed and odd cuts
• 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
• Edge-Disjoint Spanning Trees of Finite Graphs
• Equitable factorizations of edge-connected graphs
• Eulerian graphs and related topics. Part 1, Volume 1
• Factorizing regular graphs
• Nowhere-zero 3-flows and modulo \(k\)-orientations
• Nowhere‐zero 3‐flow and ‐connectedness in graphs with four edge‐disjoint spanning trees
• On the Problem of Decomposing a Graph into n Connected Factors
• The existence of planar 4-connected essentially 6-edge-connected graphs with no claw-decompositions
• The weak 3-flow conjecture and the weak circular flow conjecture

Cited in

(1)

• Modulo factors with bounded degrees

This page was built for publication: Modulo orientations with bounded out-degrees

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