Pages that link to "Item:Q3366581"
From MaRDI portal
The following pages link to A Characterization of the Interval Function of a (Finite or Infinite) Connected Graph (Q3366581):
Displaying 19 items.
- Cut vertex transit functions of hypergraphs (Q831720) (← links)
- The induced path function, monotonicity and betweenness (Q968160) (← links)
- Axiomatic characterization of the interval function of a graph (Q1024316) (← links)
- A note on the interval function of a disconnected graph (Q1692623) (← links)
- Intervals and steps in a connected graph (Q1883264) (← links)
- Interval function, induced path function, (claw, paw)-free graphs and axiomatic characterizations (Q2181243) (← links)
- Axiomatic characterization of the interval function of a bipartite graph (Q2201765) (← links)
- Betweenness in graphs: a short survey on shortest and induced path betweenness (Q2329925) (← links)
- The interval function of a connected graph and road systems (Q2370446) (← links)
- Axiomatic characterization of the interval function of a block graph (Q2407023) (← links)
- The interval function of a connected graph and a~characterization of geodetic graphs (Q2760916) (← links)
- Helly and exchange numbers of geodesic and Steiner convexities in lexicographic product of graphs (Q2788726) (← links)
- Axiomatic Characterization of Claw and Paw-Free Graphs Using Graph Transit Functions (Q2795939) (← links)
- Axiomatic Characterization of the Interval Function of a Bipartite Graph (Q2971638) (← links)
- On the distance function of a connected graph (Q3624939) (← links)
- On transit functions in weighted graphs (Q5367530) (← links)
- The axiomatic characterization of the interval function of distance hereditary graphs (Q6126719) (← links)
- (Q6150930) (← links)
- Axiomatic characterizations of Ptolemaic and chordal graphs (Q6155779) (← links)