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

DOI10.1016/J.DAM.2016.02.004MaRDI QIDQ298975zbMATH OpenOpenAlexFDO

Authors Anitha Rajkumar, A. 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)

Recommendations

• Degree-bounded factorizations of bipartite multigraphs and of pseudographs
• The simple graph threshold number \(\sigma(r,s,a,t)\) when \(r\geq 3\) is odd and \(a\geq 2\) is even
• On the number of (r,r+1)- factors in an (r,r+1)-factorization of a simple graph
• \((r,r+1)\)-factorizations of \((d,d+1)\)-graphs
• Regular multigraphs and their semiregular factorizations

Cites work

• scientific article; zbMATH DE number 4055663 (Why is no real title available?)
• scientific article; zbMATH DE number 3893248 (Why is no real title available?)
• scientific article; zbMATH DE number 3378938 (Why is no real title available?)
• Degree-bounded factorizations of bipartite multigraphs and of pseudographs
• On the number of (r,r+1)- factors in an (r,r+1)-factorization of a simple graph
• Regular multigraphs and their semiregular factorizations
• Semiregular factorization of simple graphs
• Semiregular factorizations of regular multigraphs

Cited in

(4)

• scientific article; zbMATH DE number 4127265 (Why is no real title available?)
• The simple graph threshold number \(\sigma(r,s,a,t)\) when \(r\geq 3\) is odd and \(a\geq 2\) is even
• Degree-bounded factorizations of bipartite multigraphs and of pseudographs
• scientific article; zbMATH DE number 3849286 (Why is no real title available?)

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q298975)