The following pages link to (Q5506523):
Displaying 35 items.
- A note on path domination (Q339493) (← links)
- Guides and shortcuts in graphs (Q383749) (← links)
- A note on 3-Steiner intervals and betweenness (Q409389) (← links)
- Cover-incomparability graphs and chordal graphs (Q602752) (← links)
- The induced path transit function and the Pasch axiom (Q726505) (← links)
- 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)
- Steiner intervals, geodesic intervals, and betweenness (Q1045107) (← links)
- A note on the interval function of a disconnected graph (Q1692623) (← links)
- Convexities related to path properties on graphs (Q1772411) (← links)
- Induced path transit function, monotone and Peano axioms (Q1887635) (← 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)
- Computing the hull number in \(\Delta \)-convexity (Q2205950) (← links)
- Toll convexity (Q2255809) (← links)
- Betweenness in graphs: a short survey on shortest and induced path betweenness (Q2329925) (← links)
- Cographs which are cover-incomparability graphs of posets (Q2351716) (← links)
- Axiomatic characterization of the interval function of a block graph (Q2407023) (← links)
- The All-Paths Transit Function of a Graph (Q2760973) (← 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)
- Transit sets of two-point crossover (Q5151499) (← links)
- Transit sets of -point crossover operators (Q5154624) (← links)
- Axiomatic characterization of transit functions of weak hierarchies (Q5198027) (← links)
- What Do Trees and Hypercubes Have in Common? (Q5506781) (← 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)
- Transit functions and pyramid-like binary clustering systems (Q6611037) (← links)
- Tolerant Radon partitions on the all-paths convexity in graphs (Q6651150) (← 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)
