Modulo factors with bounded degrees

DOI10.1016/J.DISC.2025.114619MaRDI QIDQ6933613zbMATH OpenFDO

Authors Morteza Hasanvand

Publication date 4 September 2025

Published in Discrete Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/J.DISC.2025.114619

zbMATH Keywords

bipartite graphedge-connectedmodulo factorpartition-connectedvertex degree

Mathematics Subject Classification ID

Vertex degrees (05C07) Connectivity (05C40)

Cites work

• A note on polynomials and \(f\)-factors of graphs
• Decomposing graphs into a constant number of locally irregular subgraphs
• Decomposing highly edge-connected graphs into homomorphic copies of a fixed tree
• Edge-decompositions of highly connected graphs into paths
• Edge-Disjoint Spanning Trees of Finite Graphs
• Equitable factorizations of edge-connected graphs
• Graph factors modulo k
• Graph theory
• scientific article; zbMATH DE number 3851127 (Why is no real title available?)
• scientific article; zbMATH DE number 3685495 (Why is no real title available?)
• Matching, Euler tours and the Chinese postman
• Modulo orientations with bounded out-degrees
• Nowhere-zero 3-flows and modulo \(k\)-orientations
• On specific factors in graphs
• On the Problem of Decomposing a Graph into n Connected Factors
• Regular subgraphs of almost regular graphs
• Sharper Bounds for the Chebyshev Functions θ(x) and ψ(x). II
• The 3-flow conjecture, factors modulo k, and the 1-2-3-conjecture
• The difference between consecutive primes. II
• The Erdős-Pósa property for odd cycles in graphs of large connectivity
• The factorization of graphs. II
• The mod k k chromatic index of graphs is O(k) O(k)
• Über Graphen und ihre Anwendung auf Determinantentheorie und Mengenlehre.

Cited in

(1)

• On modular edge colorings of graphs

This page was built for publication: Modulo factors with bounded degrees

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