Near packings of two graphs

DOI10.1016/j.disc.2016.12.022zbMath1357.05123OpenAlexW2586321066MaRDI QIDQ512568

Andrzej Żak, Jerzy Konarski

Publication date: 27 February 2017

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

Full work available at URL: https://doi.org/10.1016/j.disc.2016.12.022

zbMATH Keywords

packingnear packingvertex stable graph

Mathematics Subject Classification ID

Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Structural characterization of families of graphs (05C75) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)

Related Items (1)

The Erdős-Hajnal conjecture for three colors and triangles

Cites Work

• Unnamed Item
• Unnamed Item
• Edge disjoint placement of graphs
• Packings of graphs and applications to computational complexity
• A near packing of two graphs
• Near packings of graphs
• On (Kq;k)-Stable Graphs
• (H,k) stable graphs with minimum size
• A Graph Model for Fault-Tolerant Computing Systems

This page was built for publication: Near packings of two graphs