The following pages link to ON DISTANCES IN CHROMATIC GRAPHS (Q3480062):
Displaying 15 items.
- On chromatic numbers of nearly Kneser distance graphs (Q334403) (← links)
- A note on 2-distance chromatic numbers of graphs (Q547524) (← links)
- Computing the average distance of an interval graph (Q1334633) (← links)
- A special \(k\)-coloring for a connected \(k\)-chromatic graph (Q1363668) (← links)
- On the average Steiner distance of graphs with presribed properties (Q1372733) (← links)
- Average distance and domination number (Q1377614) (← links)
- The Wiener index of unicyclic graphs given number of pendant vertices or cut vertices (Q1677116) (← links)
- Some extremal properties of the degree distance of a graph (Q1961241) (← links)
- Upper bounds on the average eccentricity (Q2440101) (← links)
- A Chromatic Metric on Graphs (Q3064405) (← links)
- (Q4005786) (← links)
- Maximum chromatic polynomials of 2‐connected graphs (Q4277990) (← links)
- Graph colourings and partitions (Q5941502) (← links)
- Chromatic number of a line with geometric progressions of forbidden distances and the complexity of recognizing distance graphs (Q6055514) (← links)
- Chromatic coloring of distance graphs, III (Q6113545) (← links)
