An algorithm to Cyclic Path Covering Number

DOI10.1016/j.endm.2009.03.004zbMath1267.05272OpenAlexW2095094198MaRDI QIDQ2839230

A. Solairaju, Govindan Rajasekar

Publication date: 4 July 2013

Published in: Electronic Notes in Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.endm.2009.03.004

zbMATH Keywords

path covering numberpath covercyclic path covercyclic path covering number

Mathematics Subject Classification ID

Paths and cycles (05C38) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Graph algorithms (graph-theoretic aspects) (05C85) Eulerian and Hamiltonian graphs (05C45)

Related Items

An algorithm to Cyclic Path Covering Number

Cites Work

• An algorithm to Cyclic Path Covering Number
• COVERING AND PACKING IN GRAPHS, I.
• The Two-Triangle Case of the Acquaintance Graph
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item