scientific article; zbMATH DE number 2190091
From MaRDI portal
Publication:5462147
zbMath1074.05029MaRDI QIDQ5462147
Gary Chartrand, Ping Zhang, Henry Escuadro
Publication date: 1 August 2005
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items (20)
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 ⋮ Detour polynomials of vertex coalenscence and bridges coalenscence graphs ⋮ A general framework for path convexities ⋮ The forcing connected detour number of a graph ⋮ Topologies induced by graph metrics on the vertex set of graphs ⋮ Clique-to-vertex monophonic distance in graphs ⋮ The detour domination number of a graph ⋮ Edge-to-vertex m-detour monophonic number of a graph ⋮ A cut locus for finite graphs and the farthest point mapping ⋮ Characterizations of graphs with prescribed connected detour numbers ⋮ Variable neighborhood search for extremal graphs. 22. Extending bounds for independence to upper irredundance ⋮ On Hamiltonian Colorings of Block Graphs ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Unnamed Item ⋮ The edge signal number of a graph ⋮ Graphs of edge-to-vertex detour number 2
This page was built for publication:
