Greedy construction of nearly regular graphs

DOI10.1006/EUJC.1993.1025zbMath0787.05076OpenAlexW2027013453MaRDI QIDQ1260772

Seress, Ákos

Publication date: 25 August 1993

Published in: European Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1006/eujc.1993.1025

zbMATH Keywords

treematchingcoloringfactordegreesnearly regular graphs

Mathematics Subject Classification ID

Trees (05C05) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Graph algorithms (graph-theoretic aspects) (05C85)

This page was built for publication: Greedy construction of nearly regular graphs