On the number of (r,r+1)- factors in an (r,r+1)-factorization of a simple graph
From MaRDI portal
Publication:3633008
Recommendations
- \((r,r+1)\)-factorizations of \((d,d+1)\)-graphs
- On the number of 1-factorizations of a complete graph
- scientific article; zbMATH DE number 7448387
- Some problems about \(r\)-factorizations of complete graphs
- The multiplicity of 1-factors in total graphs
- On (g,f)-factorizations of graphs
- \(\{k,r-k\}\)-factors of \(r\)-regular graphs
- On the numbers of 1-factors and 1-factorizations of hypergraphs
- scientific article; zbMATH DE number 1491625
- On connencted \([g,f+1]\)-factors in graphs
Cites work
- scientific article; zbMATH DE number 4055663 (Why is no real title available?)
- A sufficient condition for equitable edge-colourings of simple graphs
- Almost‐regular factorization of graphs
- Factors and factorizations of graphs—a survey
- Semiregular factorization of simple graphs
- \((r,r+1)\)-factorizations of \((d,d+1)\)-graphs
Cited in
(6)- \((r,r+1)\)-factorizations of \((d,d+1)\)-graphs
- The pseudograph \((r, s, a, t)\)-threshold number
- Degree-bounded factorizations of bipartite multigraphs and of pseudographs
- Semiregular factorizations of regular multigraphs
- Semiregular factorization of simple graphs
- Semiregular factorization of simple graphs
This page was built for publication: On the number of (r,r+1)- factors in an (r,r+1)-factorization of a simple graph
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3633008)
