Perfect matching dominating cycle — a new dominating cycle

DOI10.1080/09720529.2009.10698251zbMath1202.05101OpenAlexW1985703580MaRDI QIDQ3400290

R. S. Lekshmi, R. Anitha

Publication date: 5 February 2010

Published in: Journal of Discrete Mathematical Sciences and Cryptography (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/09720529.2009.10698251

zbMATH Keywords

spanning treeHamilton cycleperfect matching dominating cycleperfect matching minorperfect matching sequence

Mathematics Subject Classification ID

Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)

Cites Work

• Unnamed Item
• Unnamed Item
• A sufficient condition for dominating cycles
• Advances on the Hamiltonian problem -- a survey
• On some intriguing problems in Hamiltonian graph theory---a survey
• Long dominating cycles and paths in graphs with large neighborhood unions
• On Spanning and Dominating Circuits in Graphs
• Handbook of Graph Theory

This page was built for publication: Perfect matching dominating cycle — a new dominating cycle