Dividing a graph by degrees

DOI10.1002/(SICI)1097-0118(199612)23:4%3C377::AID-JGT7%3E3.0.CO;2-OzbMATH Open0866.05051OpenAlexW4232896115MaRDI QIDQ5284585FDOQ5284585

R. P. Anstee

Publication date: 25 May 1997

Full work available at URL: https://doi.org/10.1002/(sici)1097-0118(199612)23:4%3C377::aid-jgt7%3E3.0.co;2-o

zbMATH Keywords

decompositiondegreesfractional graph

Mathematics Subject Classification ID

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

Cited In (3)

• Equitable factorizations of edge-connected graphs
• Rounding in symmetric matrices and undirected graphs
• How to Cut a Graph into Many Pieces

   Recommendations

• Title not available (Why is that?) 👍 👎
• Graph decomposition with constraints in the minimum degree 👍 👎
• Title not available (Why is that?) 👍 👎
• Efficient algorithms for decomposing graphs under degree constraints 👍 👎
• Graph decompositions without isolated vertices. II 👍 👎

This page was built for publication: Dividing a graph by degrees

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