×

The 1-factorization of some line-graphs. (English) Zbl 0523.05054


MSC:

05C70 Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.)
PDFBibTeX XMLCite
Full Text: DOI

References:

[1] Alspach, B., A 1-factorization of the line-graphs of complete graphs, J. Graph Theory, 6, 4, 441-445 (1982) · Zbl 0503.05053
[2] Berge, C., Graphes et Hypergraphes (1974), Dunod: Dunod Paris · Zbl 0213.25702
[3] Bermond, J. C., Hamiltonian decomposition of graphs, directed graphs and hypergraphs, (Bollobás, B., Advances in Graph Theory. Advances in Graph Theory, Annals Discrete Math., 3 (1978), North-Holland: North-Holland Amsterdam), 28 · Zbl 0382.05040
[4] Fiorini, S.; Wilson, R. J., Edge-colourings of Graphs (1977), Pitman: Pitman London · Zbl 0421.05023
[5] Harary, F., Graph Theory (1969), Addison-Wesley: Addison-Wesley Reading, MA · Zbl 0797.05064
[6] Jaeger, F., Sur l’indice chromatique du graphe représentatif des arêtes d’un graphe régulier, Discrete Math., 9, 161-172 (1974) · Zbl 0285.05107
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. In some cases that data have been complemented/enhanced by data from zbMATH Open. This attempts to reflect the references listed in the original paper as accurately as possible without claiming completeness or a perfect matching.