Almost regular decompositions of a graph

DOI10.1007/S10958-016-2701-9MaRDI QIDQ291175zbMATH OpenOpenAlexFDO

Authors 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) Vertex degrees (05C07) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Recommendations

• Graphical decompositions
• scientific article; zbMATH DE number 2188395
• Graph decompositions without isolated vertices III
• Graph partition into small cliques
• Graph decompositions without isolated vertices. II

Cites work

• Proof of the Seymour conjecture for large graphs

Cited in

(5)

• Almost‐regular factorization of graphs
• Decompositions of regular bipartite graphs
• Decomposition of regular hypergraphs
• A result on decompositions of regular graphs
• scientific article; zbMATH DE number 7478578 (Why is no real title available?)

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q291175)