Distance in graphs -- taking the long view

zbMath1062.05051MaRDI QIDQ1772194

Ping Zhang, Gary Chartrand

Publication date: 15 April 2005

Published in: AKCE International Journal of Graphs and Combinatorics (Search for Journal in Brave)

zbMATH Keywords

geodesicsdominationcoloringHamiltonian-connectedHamiltonian coloringdetour distancedetour number

Mathematics Subject Classification ID

Paths and cycles (05C38) Coloring of graphs and hypergraphs (05C15) Distance in graphs (05C12) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Eulerian and Hamiltonian graphs (05C45)

Related Items (15)

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 ⋮ THE PATH INDUCED DETOUR NUMBER OF SOME GRAPHS ⋮ The forcing connected detour number of a graph ⋮ Social balance - a signed detour distance analysis ⋮ Topologies induced by graph metrics on the vertex set of graphs ⋮ A cut locus for finite graphs and the farthest point mapping ⋮ Characterizations of graphs with prescribed connected detour numbers ⋮ The connected detour numbers of special classes of connected graphs ⋮ Unnamed Item ⋮ Unnamed Item ⋮ The open detour number of a graph ⋮ Graphs of edge-to-vertex detour number 2 ⋮ Unnamed Item

This page was built for publication: Distance in graphs -- taking the long view