scientific article; zbMATH DE number 5499517
From MaRDI portal
Publication:5506523
Recommendations
- Transit function on posets and lattices
- n-ary transit functions in graphs
- On transit functions in weighted graphs
- On P-transitive graphs and applications
- On adjacency-transitive graphs
- The transitivity of special graph classes
- Vertex-transitive graphs and vertex-transitive maps
- scientific article; zbMATH DE number 3939387
- scientific article; zbMATH DE number 3995734
- Some extremal properties concerning transitivity in graphs
Cited in
(56)- Axiomatic characterization of the interval function of a graph
- Triangle path transit functions, betweenness and pseudo-modular graphs
- Steiner intervals, geodesic intervals, and betweenness
- A note on the interval function of a disconnected graph
- Convexities related to path properties on graphs
- Induced path transit function, monotone and Peano axioms
- Interval function, induced path function, (claw, paw)-free graphs and axiomatic characterizations
- Axiomatic characterization of the interval function of a bipartite graph
- Computing the hull number in -convexity
- Toll convexity
- Betweenness in graphs: a short survey on shortest and induced path betweenness
- Cographs which are cover-incomparability graphs of posets
- Axiomatic characterization of the interval function of a block graph
- The All-Paths Transit Function of a Graph
- Axiomatic characterization of claw and paw-free graphs using graph transit functions
- Bigraphs and transitions
- Axiomatic characterization of the interval function of a bipartite graph
- n-ary transit functions in graphs
- The longest path transit function of a graph and betweenness
- Axiomatic characterization of transit functions of hierarchies
- Characterizing posets for which their natural transit functions coincide
- A Characterization of the Interval Function of a (Finite or Infinite) Connected Graph
- A note on path domination
- Guides and shortcuts in graphs
- A note on 3-Steiner intervals and betweenness
- Transit sets of two-point crossover
- Transit sets of k-point crossover operators
- Axiomatic characterization of transit functions of weak hierarchies
- On transit functions in weighted graphs
- Characterizations of J-monotone graphs
- On a metric related transit function and its betweenness
- Transit function on posets and lattices
- What do trees and hypercubes have in common?
- Cover-incomparability graphs and chordal graphs
- The axiomatic characterization of the interval function of distance hereditary graphs
- Segment transit function of the induced path function of graphs and its first-order definability
- Cycle transit function and betweenness
- Axiomatic characterizations of Ptolemaic and chordal graphs
- Transit functions and pyramid-like binary clustering systems
- Tolerant Radon partitions on the all-paths convexity in graphs
- Axiomatic characterization of the interval function of partial cubes and partial Hamming graphs
- On the cut-vertex and the interval transit functions of hypergraphs
- The toll walk transit function of a graph: axiomatic characterizations and first-order non-definability
- First order non-definability of some transit functions on graphs
- Convex geometries yielded by transit functions
- A characterization of uniquely representable graphs
- Transit functions and clustering systems
- Directed transit functions
- Tolerant Radon partitions of induced path convexity in graphs
- Interval monotonicity and gatedness for P₃-convexity in graphs
- On the stress transit function
- The induced path transit function and the Pasch axiom
- Cycle transit function, interval function and betweenness
- Cut vertex transit functions of hypergraphs
- The induced path function, monotonicity and betweenness
- Signed and minus clique-transversal functions on graphs
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5506523)
