Corpus ID: 184487820

Equitable factorizations of edge-connected graphs

@article{Hasanvand2019EquitableFO,
  title={Equitable factorizations of edge-connected graphs},
  author={M. Hasanvand},
  journal={arXiv: Combinatorics},
  year={2019}
}
In this paper, we show that every $(3k-3)$-edge-connected graph $G$, under a certain condition on whose degrees, can be edge-decomposed into $k$ factors $G_1,\ldots, G_k$ such that for each vertex $v\in V(G_i)$, $|d_{G_i}(v)-d_G(v)/k|< 1$, where $1\le i\le k$. As application, we deduce that every $6$-edge-connected graph $G$ can be edge-decomposed into three factors $G_1$, $G_2$, and $G_3$ such that for each vertex $v\in V(G_i)$, $|d_{G_i}(v)-d_{G}(v)/3|< 1$, unless $G$ has exactly one vertex… Expand

References

SHOWING 1-10 OF 26 REFERENCES
Improved Bounds on Nonblocking 3-Stage Clos Networks
  • 15
  • PDF
Factorizing regular graphs
  • C. Thomassen
  • Mathematics, Computer Science
  • J. Comb. Theory, Ser. B
  • 2020
  • 2
  • Highly Influential
  • PDF
Modulo Orientations with Bounded Out-Degrees and Modulo Factors with Bounded Degrees
  • 2
  • PDF
Nowhere-zero 3-flows and modulo k-orientations
  • 111
  • Highly Influential
  • PDF
Some remarks about factors of graphs
  • 4
  • PDF
Subgraphs with Prescribed Valencies
  • L~szl Lov~sz
  • 2006
  • 26
  • PDF
Equitable colorations of graphs
  • 104
  • PDF
Equitable edge-colorings of simple graphs
  • 14
A sufficient condition for equitable edge-colourings of simple graphs
  • 54
Edge Coloring and Decompositions of Weighted Graphs
  • 8
  • Highly Influential
  • PDF
...
1
2
3
...