Dividing a graph by degrees

DOI<link itemprop=identifier href="https://doi.org/10.1002/(SICI)1097-0118(199612)23:4<377::AID-JGT7>3.0.CO;2-O" /><377::AID-JGT7>3.0.CO;2-O 10.1002/(SICI)1097-0118(199612)23:4<377::AID-JGT7>3.0.CO;2-OzbMath0866.05051OpenAlexW4232896115MaRDI QIDQ5284585

Richard P. Anstee

Publication date: 25 May 1997

Full work available at URL: https://doi.org/10.1002/(sici)1097-0118(199612)23:4<377::aid-jgt7>3.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)

Related Items (2)

Equitable factorizations of edge-connected graphs ⋮ Rounding in symmetric matrices and undirected graphs

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