Decomposition of graphs into paths and cycles
From MaRDI portal
Publication:2249934
Recommendations
Cites work
- scientific article; zbMATH DE number 3353324 (Why is no real title available?)
- scientific article; zbMATH DE number 3387385 (Why is no real title available?)
- scientific article; zbMATH DE number 3404271 (Why is no real title available?)
- Acyclic graphoidal covers and path partitions in a graph
- Modeling return to isotropy using kinetic equations
- The Path-Numbers of Some Multipartite Graphs
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
- scientific article; zbMATH DE number 5239159 (Why is no real title available?)
- Induced graphoidal decompositions in product graphs
- Divisor path decomposition number of a graph
- scientific article; zbMATH DE number 554067 (Why is no real title available?)
- Co prime path decomposition number of a graph
- Splitting a graph into disjoint induced paths or cycles.
- scientific article; zbMATH DE number 5575592 (Why is no real title available?)
- scientific article; zbMATH DE number 91047 (Why is no real title available?)
- Decomposition of graph into diametral paths
- Königsberg sightseeing: Eulerian walks in temporal graphs
- Geometric path decomposition of graphs
- Eulerian walks in temporal graphs
- A bipartite graph associated to elements and class equivalences of a finite heap
- scientific article; zbMATH DE number 3959470 (Why is no real title available?)
- 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)