Hamiltonicity of connected domination critical graphs.

zbMATH Open1413.05292MaRDI QIDQ4568192FDOQ4568192

Authors: P. Kaemawichanurat, Louis Caccetta 

Publication date: 15 June 2018

Recommendations

• Hamiltonicity of domination critical claw-free graphs
• Hamiltonicity of domination vertex-critical claw-free graphs.
• Hamiltonian properties of domination-critical graphs
• Hamilton-connectivity of 3-domination critical graphs with \(\alpha =\delta +1\geqslant 5\)
• Hamilton-connectivity of 3-domination-critical graphs with \(\alpha \leqslant\delta\)

zbMATH Keywords

Hamiltoniancritical graphconnected domination

Mathematics Subject Classification ID

Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Eulerian and Hamiltonian graphs (05C45)

Cited In (12)

• Critical Hamiltonian connected graphs.
• Hamiltonicity of domination vertex-critical claw-free graphs.
• Title not available (Why is that?)
• A characterization of \(3\)-\(\gamma\)-critical graphs which are not bicritical
• Hamiltonicity of domination critical claw-free graphs
• Connected domination critical graphs with a block having maximum number of cut vertices
• Independence number and connectivity of maximal connected domination vertex critical graphs
• Traceability of connected domination critical graphs
• Hamiltonicities of double domination critical and stable claw-free graphs
• Domination number and Hamiltonicity of graphs
• The Hamiltonicity of \(k\)-connected \([s,t]\)-graphs.
• Connected domination

This page was built for publication: Hamiltonicity of connected domination critical graphs.

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