Almost regular decompositions of a graph

DOI10.1007/S10958-016-2701-9zbMath1339.05325OpenAlexW2301790770MaRDI QIDQ291175

K. S. Savenkov

Publication date: 7 June 2016

Published in: Journal of Mathematical Sciences (New York) (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10958-016-2701-9

zbMATH Keywords

maximum vertex degree

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Vertex degrees (05C07)

Cites Work

• Proof of the Seymour conjecture for large graphs

This page was built for publication: Almost regular decompositions of a graph