The pseudograph \((r, s, a, t)\)-threshold number

DOI10.1016/j.dam.2016.02.004zbMath1339.05136OpenAlexW2346194499MaRDI QIDQ298975

Anitha Rajkumar, Anthony J. W. Hilton

Publication date: 21 June 2016

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

Full work available at URL: https://doi.org/10.1016/j.dam.2016.02.004

zbMATH Keywords

bipartite graphfactorizationedge colouringspseudographthreshold number

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15)

Cites Work

• Degree-bounded factorizations of bipartite multigraphs and of pseudographs
• Semiregular factorization of simple graphs
• SEMIREGULAR FACTORIZATIONS OF REGULAR MULTIGRAPHS
• On the number of (r,r+1)- factors in an (r,r+1)-factorization of a simple graph
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: The pseudograph \((r, s, a, t)\)-threshold number