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

DOI10.1016/J.DAM.2016.02.004zbMATH Open1339.05136OpenAlexW2346194499MaRDI QIDQ298975FDOQ298975

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

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

zbMATH Keywords

bipartite graphfactorizationedge colouringspseudographthreshold number

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15)

Cites Work

• Semiregular factorization of simple graphs
• Regular multigraphs and their semiregular factorizations
• Semiregular factorizations of regular multigraphs
• On the number of (r,r+1)- factors in an (r,r+1)-factorization of a simple graph
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Degree-bounded factorizations of bipartite multigraphs and of pseudographs

Cited In (4)

• Title not available (Why is that?)
• 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
• Title not available (Why is that?)

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)