Eulerian cycle decomposition conjecture for the line graph of complete graphs

DOI10.1016/j.akcej.2018.01.012zbMath1432.05084OpenAlexW2793107901WikidataQ123146799 ScholiaQ123146799MaRDI QIDQ2293830

R. Sampathkumar, R. Rajarajachozhan

Publication date: 5 February 2020

Published in: AKCE International Journal of Graphs and Combinatorics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.akcej.2018.01.012

zbMATH Keywords

line graphEulerian graphcycle decomposition

Mathematics Subject Classification ID

Enumeration in graph theory (05C30) Paths and cycles (05C38) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Distance in graphs (05C12) Eulerian and Hamiltonian graphs (05C45) Graph operations (line graphs, products, etc.) (05C76)

Cites Work

• Unnamed Item
• Unnamed Item
• A 1-factorization of the line graphs of complete graphs
• Cycle decompositions V: Complete graphs into cycles of arbitrary lengths
• A textbook of graph theory

This page was built for publication: Eulerian cycle decomposition conjecture for the line graph of complete graphs