Semiregular factorization of simple graphs
Let a \((d,d+s)\)-graph be a graph with vertex valency only in the inteval \([d,d+s]\) for \(d,s\geq 0\). Any \((d,d+1)\)-graph is said to be semiregular. For integers \(r,s\geq 0\), let \(\phi(r,s)\) be the least integer such that for any simple \((d,d+s)\)-graph \(G\), \(d\geq \phi(r,s)\) implies that \(G\) has a \((r,r+1)\)-factorization. Although the existence of \(\phi(r,s)\) was shown for any \(r\) by some authors, the authors of this paper show that \(\phi(r,s)=r(r+s+1)\) for \(r\geq 2\) while the other cases of \(s=0\) and \(1\) were known. This result is rather nice.
- (r,r+1)-factorizations of (d,d+1)-graphs
- The pseudograph \((r, s, a, t)\)-threshold number
- scientific article; zbMATH DE number 3880758 (Why is no real title available?)
- Semiregular factorization of simple graphs
- On the number of (r,r+1)- factors in an (r,r+1)-factorization of a simple graph
- scientific article; zbMATH DE number 3893248 (Why is no real title available?)
- Degree-bounded factorizations of bipartite multigraphs and of pseudographs
This page was built for publication: Semiregular factorization of simple graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2566909)
