The regular number of a graph
Ashwin Ganesan, Radha R. Iyer

TL;DR
This paper investigates the regular number of graphs, which is the minimum partition of edges into regular subgraphs, providing exact values for certain graph families and establishing bounds that are sometimes tight.
Contribution
It determines the regular number for specific graph families and confirms the tightness of some previously known bounds.
Findings
Exact regular number for some graph families
General bounds on the regular number
Certain bounds are shown to be tight
Abstract
Let be a simple undirected graph. The regular number of is defined to be the minimum number of subsets into which the edge set of can be partitioned so that the subgraph induced by each subset is regular. In this work, we obtain the regular number of some families of graphs and discuss some general bounds on this parameter. Also, some of the lower or upper bounds proved in \cite{Kulli:Janakiram:Iyer:2001} are shown here to hold with equality.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
