Normal Eulerian clique-covering and hamiltonicity

DOI10.1016/j.ipl.2010.05.030zbMath1233.05161OpenAlexW2002886259MaRDI QIDQ765520

Thierry Vallée

Publication date: 19 March 2012

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ipl.2010.05.030

zbMATH Keywords

Hamiltonianclique coveringnormal coveringnormal Eulerian covering

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) Eulerian and Hamiltonian graphs (05C45)

Related Items (1)

A new closure concept preserving graph Hamiltonicity and based on neighborhood equivalence

Cites Work

• A new sufficient condition for hamiltonicity of graphs
• A clique-covering sufficient condition for hamiltonicity of graphs
• On a closure concept in claw-free graphs
• Advances on the Hamiltonian problem -- a survey
• Sufficient conditions for a graph to be Hamiltonian
• Updating the hamiltonian problem—A survey
• Some Theorems on Abstract Graphs
• Strengthening the closure concept in claw-free graphs
• Clique covering and degree conditions for Hamiltonicity in claw-free graphs

This page was built for publication: Normal Eulerian clique-covering and hamiltonicity