Voir la notice de l'article provenant de la source Cambridge University Press
Rodger, C. A.; III, Thomas Richard Whitt. Path Decompositions of Kneser and Generalized Kneser Graphs. Canadian mathematical bulletin, Tome 58 (2015) no. 3, pp. 610-619. doi: 10.4153/CMB-2014-068-5
@article{10_4153_CMB_2014_068_5,
author = {Rodger, C. A. and III, Thomas Richard Whitt},
title = {Path {Decompositions} of {Kneser} and {Generalized} {Kneser} {Graphs}},
journal = {Canadian mathematical bulletin},
pages = {610--619},
year = {2015},
volume = {58},
number = {3},
doi = {10.4153/CMB-2014-068-5},
url = {http://geodesic.mathdoc.fr/articles/10.4153/CMB-2014-068-5/}
}
TY - JOUR AU - Rodger, C. A. AU - III, Thomas Richard Whitt TI - Path Decompositions of Kneser and Generalized Kneser Graphs JO - Canadian mathematical bulletin PY - 2015 SP - 610 EP - 619 VL - 58 IS - 3 UR - http://geodesic.mathdoc.fr/articles/10.4153/CMB-2014-068-5/ DO - 10.4153/CMB-2014-068-5 ID - 10_4153_CMB_2014_068_5 ER -
%0 Journal Article %A Rodger, C. A. %A III, Thomas Richard Whitt %T Path Decompositions of Kneser and Generalized Kneser Graphs %J Canadian mathematical bulletin %D 2015 %P 610-619 %V 58 %N 3 %U http://geodesic.mathdoc.fr/articles/10.4153/CMB-2014-068-5/ %R 10.4153/CMB-2014-068-5 %F 10_4153_CMB_2014_068_5
[1] [1] Alspach, B. and Gavlas, H., Cycle decompositions ofK and K - I. J. Combin. Theory Ser. B 81(2001), 77–99. http://dx.doi.Org/10.1 OO6/jctb.2OOO.1 996 Google Scholar
[2] [2] Bahmanian, A. and Rodger, C. A., Multiply Balanced Edge Colorings ofMultigraphs. J. Graph Theory, to appear. http://dx.doi.Org/10.1 OO2/jgt.2O617 Google Scholar
[3] [3] Bârâny, I., A short proof of Kneser's conjecture. J. Combin. Theory Ser. A 25(1978), 325–326. http://dx.doi.Org/10.1016/0097-3165(78)90023-7 Google Scholar
[4] [4] Chen, Y., Kneser graphs are Hamiltonian for n > 3k. J. Combin. Theory Ser. B 80(2000), 69–79. http://dx.doi.Org/10.1 OO6/jctb.2OOO.1 969 +3k.+J.+Combin.+Theory+Ser.+B+80(2000),+69–79.+http://dx.doi.Org/10.1+OO6/jctb.2OOO.1+969>Google Scholar
[5] [5] Fu, H. L. and Rodger, C. A., Group divisible designs with two associate classes: n = 2 or m = 2. J. Combin. Theory Ser.A 83(1998), 94–117. http://dx.doi.Org/10.1006/jcta.1998.2868 Google Scholar
[6] [6] Fu, H. L. and Rodger, C. A., 4-cycle group divisible designs with two associate classes. Combin. Probab.Comput. 10(2001), 317–343. Google Scholar
[7] [7] Greene, J. E., A new short proof of Kneser's conjecture. Amer. Math. Monthly 109(2002), 918–920. http://dx.doi.Org/10.2307/3072460 Google Scholar
[8] [8] Hoffman, D. G., Lindner, C. C., and Rodger, C. A., On the construction of odd cycle systems. J. Graph Theory 13(1989), 417–426. http://dx.doi.Org/10.1 OO2/jgt.3190130405 Google Scholar
[9] [9] Kneser, M., Aufgabe 360. Jahresbericht der Deutschen Mathematiker-Vereinigung, 2.Abteilung 58(1955), 27. Google Scholar
[10] [10] Lovâsz, L., Kneser's conjecture, chromatic number, and homotopy. J. Combin. Theory Ser. A 25(1978), 319–324. http://dx.doi.Org/10.1016/0097-3165(78)90022-5 Google Scholar
[11] [11] Matousek, J., A combinatorial proof of Kneser's conjecture. Combinatorica 24(2004), 163–170. http://dx.doi.Org/10.1007/s00493-004-0011-1 Google Scholar
[12] [12] Šajna, Mateja, On decomposing K -1 into cycles of a fixed odd length. In: Algebraic and topological methods in graph theory (Lake Bled, 1999). Discrete Math. 244(2002), 435–444. http://dx.doi.Org/10.101 6/S0012-365X(O1 )00099-1 Google Scholar
[13] [13] Shields, Ian and Savage, Carla D., A note on Hamilton cycles in Kneser graphs. Bull. Inst. Combin. Appl. 40(2004), 13–22. Google Scholar
[14] [14] Tarsi, Michael, Decomposition of a complete multigraph into simple paths: nonbalanced handcuffed designs. J. Combin. Theory Ser. A 34(1983), 60–70. Google Scholar | DOI
Cité par Sources :