On the number of 2-packings in a connected graph
Authors:
- Konstanty Junosza-SzaniawskiKJKonstanty Junosza-Szaniawski
- Paweł RzążewskiPRPaweł Rzążewski
- 1 December 2012
- journal article
- Published by Elsevier in Discrete Mathematics
- Vol. 312 (23) , 3444-3450
Abstract
No abstract availableKeywords
This publication has 11 references indexed in Scilit:
- Exact Algorithms for L(2,1)-Labeling of GraphsAlgorithmica, 2009
- Star coloring of sparse graphsJournal of Graph Theory, 2009
- Coloring with no $2$-Colored $P_4$'sThe Electronic Journal of Combinatorics, 2004
- On computing a longest path in a treeInformation Processing Letters, 2002
- New methods for 3-SAT decision and worst-case analysisTheoretical Computer Science, 1999
- The $L(2,1)$-Labeling Problem on GraphsSIAM Journal on Discrete Mathematics, 1996
- Regular codes in regular graphs are difficultDiscrete Mathematics, 1994
- Labelling Graphs with a Condition at Distance 2SIAM Journal on Discrete Mathematics, 1992
- Relations between packing and covering numbers of a treePacific Journal of Mathematics, 1975
- On cliques in graphsIsrael Journal of Mathematics, 1965