The All-Paths Transit Function of a Graph

From MaRDI portal
Publication:2760973

DOI10.1023/A:1013715518448zbMath0977.05135OpenAlexW1545600825MaRDI QIDQ2760973

Sandi Klavžar, Manoj Changat, Henry Martyn Mulder

Publication date: 16 December 2001

Published in: Czechoslovak Mathematical Journal (Search for Journal in Brave)

Full work available at URL: https://eudml.org/doc/30646



Related Items

Cut vertex transit functions of hypergraphs, Induced path transit function, monotone and Peano axioms, 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, Two classes of graphs in which some problems related to convexity are efficiently solvable, A general framework for path convexities, A note on path domination, Cover-incomparability graphs and chordal graphs, Axiomatic characterization of the interval function of a block graph, Quasi-independence, homology and the unity of type: a topological theory of characters, Interval function, induced path function, (claw, paw)-free graphs and axiomatic characterizations, On the Carathéodory number of interval and graph convexities, Equivalence between hypergraph convexities, A note on the interval function of a disconnected graph, 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, Computing simple-path convex hulls in hypergraphs, Axiomatic characterization of the interval function of a bipartite graph, On transit functions in weighted graphs, Axiomatic Characterization of the Interval Function of a Bipartite Graph, An upper bound on the \(P_3\)-Radon number, The Carathéodory number of the \(P_3\) convexity of chordal graphs, Convex sets in lexicographic products of graphs, CHARACTERISTIC PROPERTIES AND RECOGNITION OF GRAPHS IN WHICH GEODESIC AND MONOPHONIC CONVEXITIES ARE EQUIVALENT, Transit sets of -point crossover operators, On finite convexity spaces induced by sets of paths in graphs, Toll convexity, The induced path function, monotonicity and betweenness, Convexities related to path properties on graphs, Helly and exchange numbers of geodesic and Steiner convexities in lexicographic product of graphs, Axiomatic characterization of transit functions of weak hierarchies, Geodetic convexity parameters for \((q, q - 4)\)-graphs, On the Carathéodory and exchange numbers of geodetic convexity in graphs, Axiomatic Characterization of Claw and Paw-Free Graphs Using Graph Transit Functions, Cover-incomparability graphs of posets, Axiomatic characterization of the interval function of a graph, Triangle path transit functions, betweenness and pseudo-modular graphs, Betweenness in graphs: a short survey on shortest and induced path betweenness, Cographs which are cover-incomparability graphs of posets



Cites Work