Dividing a graph by degrees

DOI10.1002/(SICI)1097-0118(199612)23:4%3C377::AID-JGT7%3E3.0.CO;2-OMaRDI QIDQ5284585zbMATH OpenOpenAlexFDO

Authors 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)

Recommendations

• scientific article; zbMATH DE number 4012650
• Graph decomposition with constraints in the minimum degree
• scientific article; zbMATH DE number 944226
• Efficient algorithms for decomposing graphs under degree constraints
• Graph decompositions without isolated vertices. II

Cited in

(3)

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

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)