On Packing Two Graphs with Bounded Sum of Sizes and Maximum Degree

DOI10.1137/130940499zbMath1314.05169OpenAlexW2005571996MaRDI QIDQ5246081

Andrzej Żak

Publication date: 17 April 2015

Published in: SIAM Journal on Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1137/130940499

zbMATH Keywords

sizemaximum degreepacking graphs

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)

Related Items (1)

A list version of graph packing

This page was built for publication: On Packing Two Graphs with Bounded Sum of Sizes and Maximum Degree