Degree-bounded factorizations of bipartite multigraphs and of pseudographs

DOI10.1016/J.DISC.2008.09.041zbMath1209.05182OpenAlexW2047997039WikidataQ114190784 ScholiaQ114190784MaRDI QIDQ960926

Anthony J. W. Hilton

Publication date: 29 March 2010

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.disc.2008.09.041

zbMATH Keywords

factorizationsbipartite multigraphs(\(a, b\))-factorizationspseudographs

Mathematics Subject Classification ID

Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Related Items (2)

The pseudograph \((r, s, a, t)\)-threshold number ⋮ SEMIREGULAR FACTORIZATIONS OF REGULAR MULTIGRAPHS

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• [a,b-factors of graphs]
• Graph factors and factorization: 1985--2003: a survey
• \((r,r+1)\)-factorizations of \((d,d+1)\)-graphs
• Semiregular factorization of simple graphs
• On the number of (r,r+1)- factors in an (r,r+1)-factorization of a simple graph
• Factors and factorizations of graphs—a survey
• [a,b-factorization of a graph]
• [a,b‐factorizations of graphs]
• On A Particular Conference Scheduling Problem
• Handbook of Graph Theory
• Almost‐regular factorization of graphs
• The Solution of a Timetabling Problem

This page was built for publication: Degree-bounded factorizations of bipartite multigraphs and of pseudographs