A new proof of Wojcicka's conjecture

DOI10.1016/S0166-218X(02)00387-6zbMath1014.05044WikidataQ123362783 ScholiaQ123362783MaRDI QIDQ1811074

Yaojun Chen, Feng Tian

Publication date: 10 June 2003

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

zbMATH Keywords

closure operationHamiltonian cycledomination-critical graph

Mathematics Subject Classification ID

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

Related Items (5)

A characterization of \(3\)-\((\gamma _{c}, 2)\)-critical claw-free graphs which are not \(3\)-\(\gamma _{c }\)-critical ⋮ Hamilton-connectivity of 3-domination critical graphs with \(\alpha =\delta +1\geqslant 5\) ⋮ The structure of \(4-\gamma \)-critical graphs with a cut vertex ⋮ Hamiltonicity of \(3_t\)EC graphs with \(\alpha=\kappa +1\) ⋮ Hamilton-connectivity of 3-domination critical graphs with \(\alpha = \delta + 2\)

Cites Work

• Unnamed Item
• A method in graph theory
• Hamiltonicity in 3-domination-critical graphs with \(\alpha= \delta+2\)
• Some properties of 3-domination-critical graphs
• Independence and connectivity in 3-domination-critical graphs
• A note on Hamiltonian circuits
• Hamiltonian properties of domination-critical graphs
• Independence and hamiltonicity in 3-domination-critical graphs
• Domination critical graphs

This page was built for publication: A new proof of Wojcicka's conjecture