Codiameters of 3-domination critical graphs with toughness more than one

DOI10.1016/j.disc.2007.11.061zbMath1173.05023OpenAlexW2073636119MaRDI QIDQ1011778

J. Martínez

Publication date: 9 April 2009

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

Full work available at URL: http://hdl.handle.net/10397/1229

zbMATH Keywords

codiameterdomination-critical graphHamilton-connectivity

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)

Cites Work

• Unnamed Item
• Hamilton-connectivity of 3-domination-critical graphs with \(\alpha \leqslant\delta\)
• Hamilton-connectivity of 3-domination critical graphs with \(\alpha = \delta + 2\)
• Hamilton-connectivity of 3-domination critical graphs with \(\alpha =\delta +1\geqslant 5\)
• 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: Codiameters of 3-domination critical graphs with toughness more than one