Hamilton-connectivity of 3-domination critical graphs with \(\alpha = \delta + 2\)

DOI10.1006/eujc.2002.0603zbMath1017.05069OpenAlexW2057895667MaRDI QIDQ1864591

Feng Tian, Yaojun Chen, Yunqing Zhang

Publication date: 18 March 2003

Published in: European Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1006/eujc.2002.0603

Mathematics Subject Classification ID

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

Related Items (3)

A note on domination 3-edge-critical planar graphs ⋮ Hamilton-connectivity of 3-domination critical graphs with \(\alpha =\delta +1\geqslant 5\) ⋮ Codiameters of 3-domination critical graphs with toughness more than one

Cites Work

• Unnamed Item
• A method in graph theory
• Hamiltonicity in 3-domination-critical graphs with \(\alpha= \delta+2\)
• Hamilton-connectivity of 3-domination-critical graphs with \(\alpha \leqslant\delta\)
• A new proof of Wojcicka's conjecture
• Independence and connectivity in 3-domination-critical graphs
• Codiameters of 3-connected 3-domination critical graphs
• Independence and hamiltonicity in 3-domination-critical graphs
• Domination critical graphs

This page was built for publication: Hamilton-connectivity of 3-domination critical graphs with \(\alpha = \delta + 2\)