Eintrag weiter verarbeiten
The complete spectrum of 6‐cycle systems of l(kn)
Gespeichert in:
| Zeitschriftentitel: | Journal of Combinatorial Designs |
|---|---|
| Personen und Körperschaften: | |
| In: | Journal of Combinatorial Designs, 3, 1995, 5, S. 353-362 |
| Format: | E-Article |
| Sprache: | Englisch |
| veröffentlicht: |
Wiley
|
| Schlagwörter: |
| author_facet |
Cox, B. A. Cox, B. A. |
|---|---|
| author |
Cox, B. A. |
| spellingShingle |
Cox, B. A. Journal of Combinatorial Designs The complete spectrum of 6‐cycle systems of l(kn) Discrete Mathematics and Combinatorics |
| author_sort |
cox, b. a. |
| spelling |
Cox, B. A. 1063-8539 1520-6610 Wiley Discrete Mathematics and Combinatorics http://dx.doi.org/10.1002/jcd.3180030506 <jats:title>Abstract</jats:title><jats:p>In this article, it is shown that a decomposition of the line graph of the complete graph on <jats:italic>n</jats:italic> vertices into cycles of length 6 exist if and only if <jats:italic>n</jats:italic> ≢ 3 (mod 4). © 1995 John Wiley & Sons, Inc.</jats:p> The complete spectrum of 6‐cycle systems of l(k<sub>n</sub>) Journal of Combinatorial Designs |
| doi_str_mv |
10.1002/jcd.3180030506 |
| facet_avail |
Online |
| finc_class_facet |
Mathematik Informatik |
| format |
ElectronicArticle |
| fullrecord |
blob:ai-49-aHR0cDovL2R4LmRvaS5vcmcvMTAuMTAwMi9qY2QuMzE4MDAzMDUwNg |
| id |
ai-49-aHR0cDovL2R4LmRvaS5vcmcvMTAuMTAwMi9qY2QuMzE4MDAzMDUwNg |
| institution |
DE-105 DE-14 DE-Ch1 DE-L229 DE-D275 DE-Bn3 DE-Brt1 DE-D161 DE-Gla1 DE-Zi4 DE-15 DE-Pl11 DE-Rs1 |
| imprint |
Wiley, 1995 |
| imprint_str_mv |
Wiley, 1995 |
| issn |
1520-6610 1063-8539 |
| issn_str_mv |
1520-6610 1063-8539 |
| language |
English |
| mega_collection |
Wiley (CrossRef) |
| match_str |
cox1995thecompletespectrumof6cyclesystemsoflkn |
| publishDateSort |
1995 |
| publisher |
Wiley |
| recordtype |
ai |
| record_format |
ai |
| series |
Journal of Combinatorial Designs |
| source_id |
49 |
| title |
The complete spectrum of 6‐cycle systems of l(kn) |
| title_unstemmed |
The complete spectrum of 6‐cycle systems of l(kn) |
| title_full |
The complete spectrum of 6‐cycle systems of l(kn) |
| title_fullStr |
The complete spectrum of 6‐cycle systems of l(kn) |
| title_full_unstemmed |
The complete spectrum of 6‐cycle systems of l(kn) |
| title_short |
The complete spectrum of 6‐cycle systems of l(kn) |
| title_sort |
the complete spectrum of 6‐cycle systems of l(k<sub>n</sub>) |
| topic |
Discrete Mathematics and Combinatorics |
| url |
http://dx.doi.org/10.1002/jcd.3180030506 |
| publishDate |
1995 |
| physical |
353-362 |
| description |
<jats:title>Abstract</jats:title><jats:p>In this article, it is shown that a decomposition of the line graph of the complete graph on <jats:italic>n</jats:italic> vertices into cycles of length 6 exist if and only if <jats:italic>n</jats:italic> ≢ 3 (mod 4). © 1995 John Wiley & Sons, Inc.</jats:p> |
| container_issue |
5 |
| container_start_page |
353 |
| container_title |
Journal of Combinatorial Designs |
| container_volume |
3 |
| format_de105 |
Article, E-Article |
| format_de14 |
Article, E-Article |
| format_de15 |
Article, E-Article |
| format_de520 |
Article, E-Article |
| format_de540 |
Article, E-Article |
| format_dech1 |
Article, E-Article |
| format_ded117 |
Article, E-Article |
| format_degla1 |
E-Article |
| format_del152 |
Buch |
| format_del189 |
Article, E-Article |
| format_dezi4 |
Article |
| format_dezwi2 |
Article, E-Article |
| format_finc |
Article, E-Article |
| format_nrw |
Article, E-Article |
| _version_ |
1792335960560631808 |
| geogr_code |
not assigned |
| last_indexed |
2024-03-01T14:52:51.109Z |
| geogr_code_person |
not assigned |
| openURL |
url_ver=Z39.88-2004&ctx_ver=Z39.88-2004&ctx_enc=info%3Aofi%2Fenc%3AUTF-8&rfr_id=info%3Asid%2Fvufind.svn.sourceforge.net%3Agenerator&rft.title=The+complete+spectrum+of+6%E2%80%90cycle+systems+of+l%28kn%29&rft.date=1995-01-01&genre=article&issn=1520-6610&volume=3&issue=5&spage=353&epage=362&pages=353-362&jtitle=Journal+of+Combinatorial+Designs&atitle=The+complete+spectrum+of+6%E2%80%90cycle+systems+of+l%28k%3Csub%3En%3C%2Fsub%3E%29&aulast=Cox&aufirst=B.+A.&rft_id=info%3Adoi%2F10.1002%2Fjcd.3180030506&rft.language%5B0%5D=eng |
| SOLR | |
| _version_ | 1792335960560631808 |
| author | Cox, B. A. |
| author_facet | Cox, B. A., Cox, B. A. |
| author_sort | cox, b. a. |
| container_issue | 5 |
| container_start_page | 353 |
| container_title | Journal of Combinatorial Designs |
| container_volume | 3 |
| description | <jats:title>Abstract</jats:title><jats:p>In this article, it is shown that a decomposition of the line graph of the complete graph on <jats:italic>n</jats:italic> vertices into cycles of length 6 exist if and only if <jats:italic>n</jats:italic> ≢ 3 (mod 4). © 1995 John Wiley & Sons, Inc.</jats:p> |
| doi_str_mv | 10.1002/jcd.3180030506 |
| facet_avail | Online |
| finc_class_facet | Mathematik, Informatik |
| format | ElectronicArticle |
| format_de105 | Article, E-Article |
| format_de14 | Article, E-Article |
| format_de15 | Article, E-Article |
| format_de520 | Article, E-Article |
| format_de540 | Article, E-Article |
| format_dech1 | Article, E-Article |
| format_ded117 | Article, E-Article |
| format_degla1 | E-Article |
| format_del152 | Buch |
| format_del189 | Article, E-Article |
| format_dezi4 | Article |
| format_dezwi2 | Article, E-Article |
| format_finc | Article, E-Article |
| format_nrw | Article, E-Article |
| geogr_code | not assigned |
| geogr_code_person | not assigned |
| id | ai-49-aHR0cDovL2R4LmRvaS5vcmcvMTAuMTAwMi9qY2QuMzE4MDAzMDUwNg |
| imprint | Wiley, 1995 |
| imprint_str_mv | Wiley, 1995 |
| institution | DE-105, DE-14, DE-Ch1, DE-L229, DE-D275, DE-Bn3, DE-Brt1, DE-D161, DE-Gla1, DE-Zi4, DE-15, DE-Pl11, DE-Rs1 |
| issn | 1520-6610, 1063-8539 |
| issn_str_mv | 1520-6610, 1063-8539 |
| language | English |
| last_indexed | 2024-03-01T14:52:51.109Z |
| match_str | cox1995thecompletespectrumof6cyclesystemsoflkn |
| mega_collection | Wiley (CrossRef) |
| physical | 353-362 |
| publishDate | 1995 |
| publishDateSort | 1995 |
| publisher | Wiley |
| record_format | ai |
| recordtype | ai |
| series | Journal of Combinatorial Designs |
| source_id | 49 |
| spelling | Cox, B. A. 1063-8539 1520-6610 Wiley Discrete Mathematics and Combinatorics http://dx.doi.org/10.1002/jcd.3180030506 <jats:title>Abstract</jats:title><jats:p>In this article, it is shown that a decomposition of the line graph of the complete graph on <jats:italic>n</jats:italic> vertices into cycles of length 6 exist if and only if <jats:italic>n</jats:italic> ≢ 3 (mod 4). © 1995 John Wiley & Sons, Inc.</jats:p> The complete spectrum of 6‐cycle systems of l(k<sub>n</sub>) Journal of Combinatorial Designs |
| spellingShingle | Cox, B. A., Journal of Combinatorial Designs, The complete spectrum of 6‐cycle systems of l(kn), Discrete Mathematics and Combinatorics |
| title | The complete spectrum of 6‐cycle systems of l(kn) |
| title_full | The complete spectrum of 6‐cycle systems of l(kn) |
| title_fullStr | The complete spectrum of 6‐cycle systems of l(kn) |
| title_full_unstemmed | The complete spectrum of 6‐cycle systems of l(kn) |
| title_short | The complete spectrum of 6‐cycle systems of l(kn) |
| title_sort | the complete spectrum of 6‐cycle systems of l(k<sub>n</sub>) |
| title_unstemmed | The complete spectrum of 6‐cycle systems of l(kn) |
| topic | Discrete Mathematics and Combinatorics |
| url | http://dx.doi.org/10.1002/jcd.3180030506 |