\em,vk\-cyclic path covering number of digraphs

MaRDI QIDQ4614843zbMATH OpenFDO

Authors G. Rajasekar

Publication date 31 January 2019

Full work available at URL https://camo.ici.ro/journal/vol15/v15a5.pdf

zbMATH Keywords

cyclic path covercyclic path covering number\(e_m\)-cyclic path covering number\(v_k\)-cyclic path cover

Mathematics Subject Classification ID

Eulerian and Hamiltonian graphs (05C45) Paths and cycles (05C38) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Recommendations

• Covering the vertices of a digraph by cycles of prescribed length
• The cycle-path indicator polynomial of a digraph
• scientific article; zbMATH DE number 147647
• scientific article; zbMATH DE number 3948328
• On \(k\)-strong and \(k\)-cyclic digraphs

This page was built for publication: \(\{em,vk\}\)-cyclic path covering number of digraphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4614843)