The All-Paths Transit Function of a Graph
From MaRDI portal
Recommendations
- scientific article; zbMATH DE number 5499517
- Induced path transit function, monotone and Peano axioms
- On a metric related transit function and its betweenness
- Interval function, induced path function, (claw, paw)-free graphs and axiomatic characterizations
- The longest path transit function of a graph and betweenness
Cites work
- scientific article; zbMATH DE number 439012 (Why is no real title available?)
- scientific article; zbMATH DE number 4050423 (Why is no real title available?)
- scientific article; zbMATH DE number 3697163 (Why is no real title available?)
- scientific article; zbMATH DE number 1339499 (Why is no real title available?)
- scientific article; zbMATH DE number 1449370 (Why is no real title available?)
- scientific article; zbMATH DE number 5499517 (Why is no real title available?)
- A characterization of the interval function of a connected graph
- Convex sets in a graph
- Convex sets in graphs. II: Minimal path convexity
- Convexity in Graphs and Hypergraphs
- Some Elementary Properties of Interval Convexities
- The induced path convexity, betweenness, and svelte graphs
Cited in
(57)- Convex geometries yielded by transit functions
- Toll convexity
- Axiomatic characterization of the toll walk function of some graph classes
- Segment transit function of the induced path function of graphs and its first-order definability
- Axiomatic characterization of the interval function of a graph
- On finite convexity spaces induced by sets of paths in graphs
- On a metric related transit function and its betweenness
- Quasi-independence, homology and the unity of type: a topological theory of characters
- Cut vertex transit functions of hypergraphs
- Betweenness in graphs: a short survey on shortest and induced path betweenness
- All-path convexity: two characterizations, general position number, and one algorithm
- Equivalence between hypergraph convexities
- Tolerant Radon partitions on the all-paths convexity in graphs
- Cover-incomparability graphs of posets
- A characterization of uniquely representable graphs
- On the Carathéodory number of interval and graph convexities
- The induced path function, monotonicity and betweenness
- An upper bound on the \(P_3\)-Radon number
- Carathéodory number of P₃-convexity of claw-free graphs
- The Carathéodory number of the \(P_3\) convexity of chordal graphs
- Convex sets in lexicographic products of graphs
- Cographs which are cover-incomparability graphs of posets
- Triangle path transit functions, betweenness and pseudo-modular graphs
- Directed transit functions
- Geodetic convexity parameters for \((q, q - 4)\)-graphs
- n-ary transit functions in graphs
- Computing simple-path convex hulls in hypergraphs
- Axiomatic characterization of the interval function of a block graph
- Tolerant Radon partitions of induced path convexity in graphs
- Interval monotonicity and gatedness for P₃-convexity in graphs
- On the Carathéodory and exchange numbers of geodetic convexity in graphs
- On the stress transit function
- Characterizing posets for which their natural transit functions coincide
- Convexities related to path properties on graphs
- Bounds on the P₃-Carathéodory number
- Helly and exchange numbers of geodesic and Steiner convexities in lexicographic product of graphs
- A note on path domination
- On the geodetic hull number of \(P_{k}\)-free graphs
- Axiomatic characterization of transit functions of hierarchies
- Geodetic convexity parameters for graphs with few short induced paths
- Transit function on posets and lattices
- Induced path transit function, monotone and Peano axioms
- Walk Domination and HHD-Free Graphs
- The toll walk transit function of a graph: axiomatic characterizations and first-order non-definability
- Interval function, induced path function, (claw, paw)-free graphs and axiomatic characterizations
- Axiomatic characterization of the interval function of a bipartite graph
- Two classes of graphs in which some problems related to convexity are efficiently solvable
- A note on the interval function of a disconnected graph
- On transit functions in weighted graphs
- First order non-definability of some transit functions on graphs
- Axiomatic characterization of claw and paw-free graphs using graph transit functions
- The longest path transit function of a graph and betweenness
- Characteristic properties and recognition of graphs in which geodesic and monophonic convexities are equivalent
- Transit sets of k-point crossover operators
- Cover-incomparability graphs and chordal graphs
- Axiomatic characterization of the interval function of a bipartite graph
- Axiomatic characterization of transit functions of weak hierarchies
This page was built for publication: The All-Paths Transit Function of a Graph
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2760973)
