Greedy construction of nearly regular graphs

DOI10.1006/eujc.1993.1025zbMath0787.05076MaRDI QIDQ1260772

Seress, Ákos, Gyula O. H. Katona

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

tree; matching; coloring; factor; degrees; nearly regular graphs

Mathematics Subject Classification ID

05C05: Trees

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

05C85: Graph algorithms (graph-theoretic aspects)