scientific article; zbMATH DE number 2028640

zbMath1033.05032MaRDI QIDQ4443931

Ping Zhang, Gary Chartrand, Garry L. Johns

Publication date: 30 March 2004

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

longest pathdetour distancedetour numberdetour set

Mathematics Subject Classification ID

Distance in graphs (05C12)

Related Items (16)

Characterization of Graphs of Connected Detour Number 2 ⋮ Weak edge triangle free detour number of a graph ⋮ Upper triangle free detour number of a graph ⋮ Upper detour monophonic number of a graph ⋮ A general framework for path convexities ⋮ THE PATH INDUCED DETOUR NUMBER OF SOME GRAPHS ⋮ The forcing connected detour number of a graph ⋮ Detour global domination for splitting graph ⋮ The detour domination number of a graph ⋮ Edge-to-vertex m-detour monophonic number of a graph ⋮ Characterizations of graphs with prescribed connected detour numbers ⋮ Unnamed Item ⋮ The connected detour numbers of special classes of connected graphs ⋮ Unnamed Item ⋮ The open detour number of a graph ⋮ Graphs of edge-to-vertex detour number 2

This page was built for publication: