On the number of (r,r+1)- factors in an (r,r+1)-factorization of a simple graph

DOI10.1002/jgt.20356zbMath1214.05123OpenAlexW4253679109MaRDI QIDQ3633008

Anthony J. W. Hilton

Publication date: 16 June 2009

Published in: Journal of Graph Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/jgt.20356

zbMATH Keywords

factorizationsfactorssimple graphs(\(r, r+1\))-factorizationssemiregular factorizations

Mathematics Subject Classification ID

Enumeration in graph theory (05C30) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Related Items (3)

The pseudograph \((r, s, a, t)\)-threshold number ⋮ Degree-bounded factorizations of bipartite multigraphs and of pseudographs ⋮ SEMIREGULAR FACTORIZATIONS OF REGULAR MULTIGRAPHS

Cites Work

• Unnamed Item
• A sufficient condition for equitable edge-colourings of simple graphs
• \((r,r+1)\)-factorizations of \((d,d+1)\)-graphs
• Semiregular factorization of simple graphs
• Factors and factorizations of graphs—a survey
• Almost‐regular factorization of 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