On the number of 2-packings in a connected graph

DOI10.1016/j.disc.2012.02.005zbMath1251.05138DBLPjournals/dm/Junosza-SzaniawskiR12OpenAlexW2053879235WikidataQ62595922 ScholiaQ62595922MaRDI QIDQ1761463

Konstanty Junosza-Szaniawski, Paweł Rzążewski

Publication date: 15 November 2012

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

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

zbMATH Keywords

extremal graph theory2-packingexponential algorithm

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Graph labelling (graceful graphs, bandwidth, etc.) (05C78)

Related Items (2)

Graphs with unique maximum packing of closed neighborhoods ⋮ (Open) packing number of some graph products

Cites Work

• Exact algorithms for \(L(2,1)\)-labeling of graphs
• Relations between packing and covering numbers of a tree
• Regular codes in regular graphs are difficult
• On computing a longest path in a tree
• Coloring with no 2-colored \(P_4\)'s
• New methods for 3-SAT decision and worst-case analysis
• On Improved Exact Algorithms for L(2,1)-Labeling of Graphs
• Star coloring of sparse graphs
• A Note on Independent Sets in Trees
• Labelling Graphs with a Condition at Distance 2
• The $L(2,1)$-Labeling Problem on Graphs
• On cliques in graphs

This page was built for publication: On the number of 2-packings in a connected graph