The following pages link to Peter Dankelmann (Q233440):
Displaying 50 items.
- A note on extremal values of the scattering number (Q384905) (← links)
- A characterization of graphs by codes from their incidence matrices (Q396825) (← links)
- Upper bounds on the Steiner diameter of a graph (Q444450) (← links)
- Distance and size in digraphs (Q468452) (← links)
- Steiner diameter of 3, 4 and 5-connected maximal planar graphs (Q477352) (← links)
- Maximally edge-connected hypergraphs (Q501024) (← links)
- The number of edges in a bipartite graph of given radius (Q533777) (← links)
- Degree distance of unicyclic and bicyclic graphs (Q534341) (← links)
- Hamiltonicity of \(k\)-traceable graphs (Q540049) (← links)
- On the distance distribution of trees (Q548265) (← links)
- The diameter of almost Eulerian digraphs (Q612941) (← links)
- Average distance in weighted graphs (Q658013) (← links)
- Average distance and generalised packing in graphs (Q708381) (← links)
- On the number of resolving pairs in graphs (Q897274) (← links)
- Diameter and maximum degree in Eulerian digraphs (Q906483) (← links)
- (Q947130) (redirect page) (← links)
- Embedding graphs as isometric medians (Q947131) (← links)
- On the degree distance of a graph (Q967319) (← links)
- On complexity of minimum leaf out-branching problem (Q967352) (← links)
- Minimum size of a graph or digraph of given radius (Q989544) (← links)
- Diameter of 4-colourable graphs (Q1024307) (← links)
- The edge-Wiener index of a graph (Q1025981) (← links)
- A linear-time algorithm to compute a MAD tree of an interval graph (Q1029091) (← links)
- Inverse degree and edge-connectivity (Q1043655) (← links)
- Domination with exponential decay (Q1045130) (← links)
- Average distance and independence number (Q1329805) (← links)
- Computing the average distance of an interval graph (Q1334633) (← links)
- On the average Steiner distance of graphs with presribed properties (Q1372733) (← links)
- Average distance and domination number (Q1377614) (← links)
- Bounds on the average connectivity of a graph (Q1406026) (← links)
- MAD trees and distance-hereditary graphs (Q1408821) (← links)
- Weighted domination in triangle-free graphs (Q1613448) (← links)
- A degree condition for diameter two orientability of graphs (Q1727780) (← links)
- Average eccentricity, \(k\)-packing and \(k\)-domination in graphs (Q1732757) (← links)
- The radius of \(k\)-connected planar graphs with bounded faces (Q1759405) (← links)
- The diameter of directed graphs (Q1775900) (← links)
- On strong distances in oriented graphs (Q1810644) (← links)
- Maximum sizes of graphs with given domination parameters (Q1827704) (← links)
- Factor domination and minimum degree (Q1868841) (← links)
- Minimum average distance of strong orientations of graphs (Q1887055) (← links)
- Eccentric counts, connectivity and chordality (Q1941698) (← links)
- Codes from incidence matrices of graphs (Q1951220) (← links)
- Degree sequence conditions for maximally edge-connected graphs depending on the clique number (Q1969791) (← links)
- Average eccentricity, minimum degree and maximum degree in graphs (Q2023121) (← links)
- On average distance in tournaments and Eulerian digraphs (Q2026317) (← links)
- Steiner diameter, maximum degree and size of a graph (Q2032893) (← links)
- Proof of a conjecture on the Wiener index of Eulerian graphs (Q2032981) (← links)
- Bounding the \(k\)-Steiner Wiener and Wiener-type indices of trees in terms of eccentric sequence (Q2035838) (← links)
- Proximity and remoteness in triangle-free and \(C_4\)-free graphs in terms of order and minimum degree (Q2037591) (← links)
- Size of graphs and digraphs with given diameter and connectivity constraints (Q2043684) (← links)
