ON DISTANCES IN CHROMATIC GRAPHS

DOI10.1093/QMATH/40.4.475zbMath0702.05034OpenAlexW2029653913MaRDI QIDQ3480062

Ioan Tomescu, Robert A. Melter

Publication date: 1989

Published in: The Quarterly Journal of Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1093/qmath/40.4.475

zbMATH Keywords

distancek-chromatic graph

Mathematics Subject Classification ID

Paths and cycles (05C38) Coloring of graphs and hypergraphs (05C15)

Related Items (7)

Computing the average distance of an interval graph ⋮ On the average Steiner distance of graphs with presribed properties ⋮ Average distance and domination number ⋮ The Wiener index of unicyclic graphs given number of pendant vertices or cut vertices ⋮ Upper bounds on the average eccentricity ⋮ Some extremal properties of the degree distance of a graph ⋮ Graph colourings and partitions

This page was built for publication: ON DISTANCES IN CHROMATIC GRAPHS