Pages that link to "Item:Q2407023"
From MaRDI portal
The following pages link to Axiomatic characterization of the interval function of a block graph (Q2407023):
Displaying 18 items.
- Finite Sholander trees, trees, and their betweenness (Q641185) (← links)
- Cut vertex transit functions of hypergraphs (Q831720) (← links)
- Axiomatic characterization of the median function of a block graph (Q831734) (← links)
- A note on the interval function of a disconnected graph (Q1692623) (← 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)
- 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)
- Axiomatic characterization of transit functions of hierarchies (Q3174798) (← links)
- A Characterization of the Interval Function of a (Finite or Infinite) Connected Graph (Q3366581) (← links)
- Axiomatic characterization of transit functions of weak hierarchies (Q5198027) (← links)
- The axiomatic characterization of the interval function of distance hereditary graphs (Q6126719) (← links)
- Axiomatic characterization of the toll walk function of some graph classes (Q6132559) (← links)
- Axiomatic characterizations of Ptolemaic and chordal graphs (Q6155779) (← links)
- First-order logic axiomatization of metric graph theory (Q6196830) (← links)
- Axiomatic characterization of the interval function of partial cubes and partial Hamming graphs (Q6651154) (← links)
- On the cut-vertex and the interval transit functions of hypergraphs (Q6660055) (← links)