Decomposition of graphs into paths and cycles
From MaRDI portal
Publication:2249934
DOI10.1155/2013/721051zbMATH Open1295.05184OpenAlexW1984843974WikidataQ58920037 ScholiaQ58920037MaRDI QIDQ2249934FDOQ2249934
Authors: S. Arumugam, I. Sahul Hamid, V. M. Abraham
Publication date: 4 July 2014
Published in: Journal of Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1155/2013/721051
Recommendations
Paths and cycles (05C38) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)
Cites Work
Cited In (18)
- A variation of decomposition under a length constraint
- Encryption and decryption using decomposition of complete graph \(K_{3(6n+1)}\)
- Decomposing graphs into internally-disjoint induced paths
- Title not available (Why is that?)
- Induced graphoidal decompositions in product graphs
- Divisor path decomposition number of a graph
- Title not available (Why is that?)
- Co prime path decomposition number of a graph
- Splitting a graph into disjoint induced paths or cycles.
- Title not available (Why is that?)
- Title not available (Why is that?)
- Decomposition of graph into diametral paths
- Geometric path decomposition of graphs
- Königsberg sightseeing: Eulerian walks in temporal graphs
- Eulerian walks in temporal graphs
- A bipartite graph associated to elements and class equivalences of a finite heap
- Title not available (Why is that?)
- Equiparity path decomposition number of a graph
This page was built for publication: Decomposition of graphs into paths and cycles
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2249934)