A list version of graph packing

DOI10.1016/J.DISC.2016.03.001zbMath1337.05086arXiv1501.02488OpenAlexW1508505492MaRDI QIDQ284763

Alexandr V. Kostochka, Derrek Yager, Andrew McConvey, Ervin Gyoeri

Publication date: 18 May 2016

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

Full work available at URL: https://arxiv.org/abs/1501.02488

zbMATH Keywords

maximum degreelist coloringedge sumgraph packing

Mathematics Subject Classification ID

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

Related Items (1)

Packing a number of copies of a \(( p , q )\)-graph

Cites Work

• Unnamed Item
• Toward Żak's conjecture on graph packing
• Edge disjoint placement of graphs
• On packing bipartite graphs
• Packings of graphs and applications to computational complexity
• Fixed-point-free embeddings of graphs in their complements
• Subgraphs of graphs. I
• Extremal Graphs for a Graph Packing Theorem of Sauer and Spencer
• On Packing Two Graphs with Bounded Sum of Sizes and Maximum Degree

This page was built for publication: A list version of graph packing